Sciweavers

    STOC
    2001
    ACM
    137views Algorithms» more  STOC 2001»
    Computing with continuous-time Liapunov systems
    14 years 10 months ago
    Computing with continuous-time Liapunov systems
    Download  www.tcs.hut.fi
    Jirí Síma, Pekka Orponen
    claim paper
    Read More »
    STOC
    2001
    ACM
    163views Algorithms» more  STOC 2001»
    Extractor codes
    14 years 10 months ago
    Extractor codes
    Download  www.cs.tau.ac.il
    We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
    Amnon Ta-Shma, David Zuckerman
    claim paper
    Read More »
    STOC
    2001
    ACM
    133views Algorithms» more  STOC 2001»
    Loss-less condensers, unbalanced expanders, and extractors
    14 years 10 months ago
    Loss-less condensers, unbalanced expanders, and extractors
    Download  www.cs.tau.ac.il
    Amnon Ta-Shma, Christopher Umans, David Zuckerman
    claim paper
    Read More »
    STOC
    2001
    ACM
    144views Algorithms» more  STOC 2001»
    Decidability of string graphs
    14 years 10 months ago
    Decidability of string graphs
    Download  people.cs.uchicago.edu
    Marcus Schaefer, Daniel Stefankovic
    claim paper
    Read More »
    STOC
    2001
    ACM
    317views Algorithms» more  STOC 2001»
    Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
    14 years 10 months ago
    Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
    Download  page.mi.fu-berlin.de
    Daniel A. Spielman, Shang-Hua Teng
    claim paper
    Read More »
    STOC
    2001
    ACM
    109views Algorithms» more  STOC 2001»
    Stackelberg scheduling strategies
    14 years 10 months ago
    Stackelberg scheduling strategies
    Download  www.cs.nyu.edu
    Tim Roughgarden
    claim paper
    Read More »
    STOC
    2001
    ACM
    116views Algorithms» more  STOC 2001»
    Regular resolution lower bounds for the weak pigeonhole principle
    14 years 10 months ago
    Regular resolution lower bounds for the weak pigeonhole principle
    Download  www.cs.helsinki.fi
    Toniann Pitassi, Ran Raz
    claim paper
    Read More »
    STOC
    2001
    ACM
    114views Algorithms» more  STOC 2001»
    Testing metric properties
    14 years 10 months ago
    Testing metric properties
    Download  www.eng.tau.ac.il
    Michal Parnas, Dana Ron
    claim paper
    Read More »
    STOC
    2001
    ACM
    119views Algorithms» more  STOC 2001»
    Algorithms, games, and the internet
    14 years 10 months ago
    Algorithms, games, and the internet
    Download  www.cse.iitb.ac.in
    Christos H. Papadimitriou
    claim paper
    Read More »
    STOC
    2001
    ACM
    151views Algorithms» more  STOC 2001»
    On the cell probe complexity of membership and perfect hashing
    14 years 10 months ago
    On the cell probe complexity of membership and perfect hashing
    Download  www.it-c.dk
    We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
    Rasmus Pagh
    claim paper
    Read More »
    « first‹ previous…474475476477478479480481482…next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.