Abstract is missing.
- Quantum complexity theoryEthan Bernstein, Umesh V. Vazirani. 11-20 [doi]
- Thermodynamics of computation and information distanceCharles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek. 21-30 [doi]
- k one-way heads cannot do string-matchingTao Jiang, Ming Li. 62-70 [doi]
- Multiple matching of rectangular patternsRamana M. Idury, Alejandro A. Schäffer. 81-90 [doi]
- Generalized FLP impossibility result for t-resilient asynchronous computationsElizabeth Borowsky, Eli Gafni. 91-100 [doi]
- The asynchronous computability theorem for t-resilient tasksMaurice Herlihy, Nir Shavit. 111-120 [doi]
- Linear programming without the matrixChristos H. Papadimitriou, Mihalis Yannakakis. 121-129 [doi]
- Comparison-based search in the presence of errorsRyan S. Borgstrom, S. Rao Kosaraju. 130-136 [doi]
- A robust model for finding optimal evolutionary treesMartin Farach, Sampath Kannan, Tandy Warnow. 137-145 [doi]
- Maximum k-chains in planar point sets: combinatorial structure and algorithmsStefan Felsner, Lorenz Wernisch. 146-153 [doi]
- Lower bounds for randomized mutual exclusionEyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman. 154-163 [doi]
- Competitive distributed file allocationBaruch Awerbuch, Yair Bartal, Amos Fiat. 164-173 [doi]
- Contention in shared memory algorithmsCynthia Dwork, Maurice Herlihy, Orli Waarts. 174-183 [doi]
- What can be computed locally?Moni Naor, Larry J. Stockmeyer. 184-193 [doi]
- Reinventing the wheel: an optimal data structure for connectivity queriesRobert F. Cohen, Giuseppe Di Battista, Arkady Kanevsky, Roberto Tamassia. 194-200 [doi]
- Locality based graph coloringMario Szegedy, Sundar Vishwanathan. 201-207 [doi]
- Separator based sparsification for dynamic planar graph algorithmsDavid Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer. 208-217 [doi]
- A linear time algorithm for finding tree-decompositions of small treewidthHans L. Bodlaender. 226-234 [doi]
- Expanders that beat the eigenvalue bound: explicit construction and applicationsAvi Wigderson, David Zuckerman. 245-251 [doi]
- The biased coin problemRavi B. Boppana, Babu O. Narayanan. 252-257 [doi]
- Efficient construction of a small hitting set for combinatorial rectangles in high dimensionNathan Linial, Michael Luby, Michael E. Saks, David Zuckerman. 258-267 [doi]
- Constructing small sample spaces satisfying given constraintsDaphne Koller, Nimrod Megiddo. 268-277 [doi]
- Mapping the genome: some combinatorial problems arising in molecular biologyRichard M. Karp. 278-285 [doi]
- On the hardness of approximating minimization problemsCarsten Lund, Mihalis Yannakakis. 286-293 [doi]
- Efficient probabilistically checkable proofs and applications to approximationsMihir Bellare, Shafi Goldwasser, Carsten Lund, A. Russeli. 294-304 [doi]
- Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functionsAnne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor. 305-314 [doi]
- Efficient learning of typical finite automata from random walksYoav Freund, Michael J. Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie. 315-324 [doi]
- Finiteness results for sigmoidal neural networksAngus Macintyre, Eduardo D. Sontag. 325-334 [doi]
- Bounds for the computational power and learning complexity of analog neural netsWolfgang Maass. 335-344 [doi]
- Proportionate progress: a notion of fairness in resource allocationSanjoy K. Baruah, N. K. Cohen, C. Greg Plaxton, Donald A. Varvel. 345-354 [doi]
- Self-routing superconcentratorsNicholas Pippenger. 355-361 [doi]
- Space-efficient scheduling of multithreaded computationsRobert D. Blumofe, Charles E. Leiserson. 362-371 [doi]
- Cryptographic hardness of distribution-specific learningMichael Kharitonov. 372-381 [doi]
- How to use expert adviceNicolò Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, Manfred K. Warmuth. 382-391 [doi]
- Online load balancing and network flowSteven Phillips, Jeffery Westbrook. 402-411 [doi]
- Markov chains, computer proofs, and average-case analysis of best fit bin packingEdward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber. 412-421 [doi]
- Angles of planar triangular graphsGiuseppe Di Battista, Luca Vismara. 431-437 [doi]
- Many birds with one stone: multi-objective approximation algorithmsR. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III. 438-447 [doi]
- A parallel approximation algorithm for positive linear programmingMichael Luby, Noam Nisan. 448-457 [doi]
- Randomness-optimal unique element isolation, with applications to perfect matching and related problemsSuresh Chari, Pankaj Rohatgi, Aravind Srinivasan. 458-467 [doi]
- Decision trees: old and new resultsRudolf Fleischer. 468-477 [doi]
- A deterministic algorithm for the three-dimensional diameter problemJirí Matousek, Otfried Schwarzkopf. 478-484 [doi]
- Matrix searching with the shortest path metricJohn Hershberger, Subhash Suri. 485-494 [doi]
- Improved bounds on weak epsilon-nets for convex setsBernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl. 495-504 [doi]
- Piecewise linear paths among convex obstaclesMark de Berg, Jirí Matousek, Otfried Schwarzkopf. 505-514 [doi]
- Depth reduction for noncommutative arithmetic circuitsEric Allender, Jia Jiao. 515-522 [doi]
- Modified ranks of tensors and the size of circuitsPavel Pudlák, Vojtech Rödl. 523-531 [doi]
- Characterizing non-deterministic circuit sizeMauricio Karchmer, Avi Wigderson. 532-540 [doi]
- Size-depth trade-offs for threshold circuitsRussell Impagliazzo, Ramamohan Paturi, Michael E. Saks. 541-550 [doi]
- Simulating threshold circuits by majority circuitsMikael Goldmann, Marek Karpinski. 551-560 [doi]
- Multi-scale self-simulation: a technique for reconfiguring arrays with faultsRichard Cole, Bruce M. Maggs, Ramesh K. Sitaraman. 561-572 [doi]
- How much can hardware help routing?Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal. 573-582 [doi]
- Routing permutations on graphs via matchingsNoga Alon, Fan R. K. Chung, Ronald L. Graham. 583-591 [doi]
- Parametric real-time reasoningRajeev Alur, Thomas A. Henzinger, Moshe Y. Vardi. 592-601 [doi]
- Constant time factors do matterNeil D. Jones. 602-611 [doi]
- Monotone monadic SNP and constraint satisfactionTomás Feder, Moshe Y. Vardi. 612-622 [doi]
- On-line load balancing with applications to machine scheduling and virtual circuit routingJames Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts. 623-631 [doi]
- Approximate load balancing on dynamic and asynchronous networksWilliam Aiello, Baruch Awerbuch, Bruce M. Maggs, Satish Rao. 632-641 [doi]
- Time optimal self-stabilizing synchronizationBaruch Awerbuch, Shay Kutten, Yishay Mansour, Boaz Patt-Shamir, George Varghese. 652-661 [doi]
- Fast perfection-information leader-election protocol with linear immunityJason Cooper, Nathan Linial. 662-671 [doi]
- Excluded minors, network decomposition, and multicommodity flowPhilip N. Klein, Serge A. Plotkin, Satish Rao. 682-690 [doi]
- Improved bounds on the max-flow min-cut ratio for multicommodity flowsSerge A. Plotkin, Éva Tardos. 691-697 [doi]
- Approximate max-flow min-(multi)cut theorems and their applicationsNaveen Garg, Vijay V. Vazirani, Mihalis Yannakakis. 698-707 [doi]
- Time-space trade-offs for undirected st-connectivity on a JAGJeff Edmonds. 718-727 [doi]
- Short random walks on graphsGreg Barnes, Uriel Feige. 728-737 [doi]
- Deterministic coding for interactive communicationLeonard J. Schulman. 747-756 [doi]
- An O~(n:::2:::) algorithm for minimum cutsDavid R. Karger, Clifford Stein. 757-765 [doi]
- Finding minimum-quotient cuts in planar graphsJames K. Park, Cynthia A. Phillips. 766-775 [doi]
- The network inhibition problemCynthia A. Phillips. 776-785 [doi]
- Checking approximate computations over the realsSigal Ar, Manuel Blum, Bruno Codenotti, Peter Gemmell. 786-795 [doi]
- On the generation of multivariate polynomials which are hard to factorAdi Shamir. 796-804 [doi]
- Counting curves and their projectionsJoachim von zur Gathen, Marek Karpinski, Igor Shparlinski. 805-812 [doi]