Conferences in DBLP
Arthur W. Chou , Ker-I Ko Some complexity issues on the simply connected regions of the two-dimensional plane. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:1-10 [Conf ] Ethan Bernstein , Umesh V. Vazirani Quantum complexity theory. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:11-20 [Conf ] Charles H. Bennett , Péter Gács , Ming Li , Paul M. B. Vitányi , Wojciech H. Zurek Thermodynamics of computation and information distance. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:21-30 [Conf ] Juan A. Garay , Yoram Moses Fully polynomial Byzantine agreement in t+1 rounds. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:31-41 [Conf ] Ran Canetti , Tal Rabin Fast asynchronous Byzantine agreement with optimal resilience. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:42-51 [Conf ] Michael Ben-Or , Ran Canetti , Oded Goldreich Asynchronous secure computation. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:52-61 [Conf ] Tao Jiang , Ming Li k one-way heads cannot do string-matching. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:62-70 [Conf ] Brenda S. Baker A theory of parameterized pattern matching: algorithms and applications. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:71-80 [Conf ] Ramana M. Idury , Alejandro A. Schäffer Multiple matching of rectangular patterns. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:81-90 [Conf ] Elizabeth Borowsky , Eli Gafni Generalized FLP impossibility result for t-resilient asynchronous computations. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:91-100 [Conf ] Michael E. Saks , Fotios Zaharoglou Wait-free k-set agreement is impossible: the topology of public knowledge. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:101-110 [Conf ] Maurice Herlihy , Nir Shavit The asynchronous computability theorem for t-resilient tasks. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:111-120 [Conf ] Christos H. Papadimitriou , Mihalis Yannakakis Linear programming without the matrix. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:121-129 [Conf ] Ryan S. Borgstrom , S. Rao Kosaraju Comparison-based search in the presence of errors. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:130-136 [Conf ] Martin Farach , Sampath Kannan , Tandy Warnow A robust model for finding optimal evolutionary trees. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:137-145 [Conf ] Stefan Felsner , Lorenz Wernisch Maximum k-chains in planar point sets: combinatorial structure and algorithms. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:146-153 [Conf ] Eyal Kushilevitz , Yishay Mansour , Michael O. Rabin , David Zuckerman Lower bounds for randomized mutual exclusion. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:154-163 [Conf ] Baruch Awerbuch , Yair Bartal , Amos Fiat Competitive distributed file allocation. [Citation Graph (4, 0)][DBLP ] STOC, 1993, pp:164-173 [Conf ] Cynthia Dwork , Maurice Herlihy , Orli Waarts Contention in shared memory algorithms. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:174-183 [Conf ] Moni Naor , Larry J. Stockmeyer What can be computed locally? [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:184-193 [Conf ] Robert F. Cohen , Giuseppe Di Battista , Arkady Kanevsky , Roberto Tamassia Reinventing the wheel: an optimal data structure for connectivity queries. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:194-200 [Conf ] Mario Szegedy , Sundar Vishwanathan Locality based graph coloring. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:201-207 [Conf ] David Eppstein , Zvi Galil , Giuseppe F. Italiano , Thomas H. Spencer Separator based sparsification for dynamic planar graph algorithms. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:208-217 [Conf ] Leslie Ann Goldberg Polynomial space polynomial delay algorithms for listing families of graphs. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:218-225 [Conf ] Hans L. Bodlaender A linear time algorithm for finding tree-decompositions of small treewidth. [Citation Graph (3, 0)][DBLP ] STOC, 1993, pp:226-234 [Conf ] Noam Nisan , David Zuckerman More deterministic simulation in logspace. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:235-244 [Conf ] Avi Wigderson , David Zuckerman Expanders that beat the eigenvalue bound: explicit construction and applications. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:245-251 [Conf ] Ravi B. Boppana , Babu O. Narayanan The biased coin problem. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:252-257 [Conf ] Nathan Linial , Michael Luby , Michael E. Saks , David Zuckerman Efficient construction of a small hitting set for combinatorial rectangles in high dimension. [Citation Graph (1, 0)][DBLP ] STOC, 1993, pp:258-267 [Conf ] Daphne Koller , Nimrod Megiddo Constructing small sample spaces satisfying given constraints. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:268-277 [Conf ] Richard M. Karp Mapping the genome: some combinatorial problems arising in molecular biology. [Citation Graph (1, 0)][DBLP ] STOC, 1993, pp:278-285 [Conf ] Carsten Lund , Mihalis Yannakakis On the hardness of approximating minimization problems. [Citation Graph (1, 0)][DBLP ] STOC, 1993, pp:286-293 [Conf ] Mihir Bellare , Shafi Goldwasser , Carsten Lund , A. Russeli Efficient probabilistically checkable proofs and applications to approximations. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:294-304 [Conf ] Anne Condon , Joan Feigenbaum , Carsten Lund , Peter W. Shor Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:305-314 [Conf ] Yoav Freund , Michael J. Kearns , Dana Ron , Ronitt Rubinfeld , Robert E. Schapire , Linda Sellie Efficient learning of typical finite automata from random walks. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:315-324 [Conf ] Angus Macintyre , Eduardo D. Sontag Finiteness results for sigmoidal "neural" networks. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:325-334 [Conf ] Wolfgang Maass Bounds for the computational power and learning complexity of analog neural nets. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:335-344 [Conf ] Sanjoy K. Baruah , N. K. Cohen , C. Greg Plaxton , Donald A. Varvel Proportionate progress: a notion of fairness in resource allocation. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:345-354 [Conf ] Nicholas Pippenger Self-routing superconcentrators. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:355-361 [Conf ] Robert D. Blumofe , Charles E. Leiserson Space-efficient scheduling of multithreaded computations. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:362-371 [Conf ] Michael Kharitonov Cryptographic hardness of distribution-specific learning. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:372-381 [Conf ] Nicolò Cesa-Bianchi , Yoav Freund , David P. Helmbold , David Haussler , Robert E. Schapire , Manfred K. Warmuth How to use expert advice. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:382-391 [Conf ] Michael J. Kearns Efficient noise-tolerant learning from statistical queries. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:392-401 [Conf ] Steven Phillips , Jeffery Westbrook Online load balancing and network flow. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:402-411 [Conf ] Edward G. Coffman Jr. , David S. Johnson , Peter W. Shor , Richard R. Weber Markov chains, computer proofs, and average-case analysis of best fit bin packing. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:412-421 [Conf ] Marshall W. Bern , Daniel H. Greene , Arvind Raghunathan On-line algorithms for cache sharing. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:422-430 [Conf ] Giuseppe Di Battista , Luca Vismara Angles of planar triangular graphs. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:431-437 [Conf ] R. Ravi , Madhav V. Marathe , S. S. Ravi , Daniel J. Rosenkrantz , Harry B. Hunt III Many birds with one stone: multi-objective approximation algorithms. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:438-447 [Conf ] Michael Luby , Noam Nisan A parallel approximation algorithm for positive linear programming. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:448-457 [Conf ] Suresh Chari , Pankaj Rohatgi , Aravind Srinivasan Randomness-optimal unique element isolation, with applications to perfect matching and related problems. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:458-467 [Conf ] Rudolf Fleischer Decision trees: old and new results. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:468-477 [Conf ] Jirí Matousek , Otfried Schwarzkopf A deterministic algorithm for the three-dimensional diameter problem. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:478-484 [Conf ] John Hershberger , Subhash Suri Matrix searching with the shortest path metric. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:485-494 [Conf ] Bernard Chazelle , Herbert Edelsbrunner , Michelangelo Grigni , Leonidas J. Guibas , Micha Sharir , Emo Welzl Improved bounds on weak epsilon-nets for convex sets. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:495-504 [Conf ] Mark de Berg , Jirí Matousek , Otfried Schwarzkopf Piecewise linear paths among convex obstacles. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:505-514 [Conf ] Eric Allender , Jia Jiao Depth reduction for noncommutative arithmetic circuits. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:515-522 [Conf ] Pavel Pudlák , Vojtech Rödl Modified ranks of tensors and the size of circuits. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:523-531 [Conf ] Mauricio Karchmer , Avi Wigderson Characterizing non-deterministic circuit size. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:532-540 [Conf ] Russell Impagliazzo , Ramamohan Paturi , Michael E. Saks Size-depth trade-offs for threshold circuits. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:541-550 [Conf ] Mikael Goldmann , Marek Karpinski Simulating threshold circuits by majority circuits. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:551-560 [Conf ] Richard Cole , Bruce M. Maggs , Ramesh K. Sitaraman Multi-scale self-simulation: a technique for reconfiguring arrays with faults. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:561-572 [Conf ] Allan Borodin , Prabhakar Raghavan , Baruch Schieber , Eli Upfal How much can hardware help routing? [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:573-582 [Conf ] Noga Alon , Fan R. K. Chung , Ronald L. Graham Routing permutations on graphs via matchings. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:583-591 [Conf ] Rajeev Alur , Thomas A. Henzinger , Moshe Y. Vardi Parametric real-time reasoning. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:592-601 [Conf ] Neil D. Jones Constant time factors do matter. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:602-611 [Conf ] Tomás Feder , Moshe Y. Vardi Monotone monadic SNP and constraint satisfaction. [Citation Graph (4, 0)][DBLP ] STOC, 1993, pp:612-622 [Conf ] James Aspnes , Yossi Azar , Amos Fiat , Serge A. Plotkin , Orli Waarts On-line load balancing with applications to machine scheduling and virtual circuit routing. [Citation Graph (1, 0)][DBLP ] STOC, 1993, pp:623-631 [Conf ] William Aiello , Baruch Awerbuch , Bruce M. Maggs , Satish Rao Approximate load balancing on dynamic and asynchronous networks. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:632-641 [Conf ] Anja Feldmann , Ming-Yang Kao , Jiri Sgall , Shang-Hua Teng Optimal online scheduling of parallel jobs with dependencies. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:642-651 [Conf ] Baruch Awerbuch , Shay Kutten , Yishay Mansour , Boaz Patt-Shamir , George Varghese Time optimal self-stabilizing synchronization. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:652-661 [Conf ] Jason Cooper , Nathan Linial Fast perfection-information leader-election protocol with linear immunity. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:662-671 [Conf ] Charles Rackoff , Daniel R. Simon Cryptographic defense against traffic analysis. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:672-681 [Conf ] Philip N. Klein , Serge A. Plotkin , Satish Rao Excluded minors, network decomposition, and multicommodity flow. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:682-690 [Conf ] Serge A. Plotkin , Éva Tardos Improved bounds on the max-flow min-cut ratio for multicommodity flows. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:691-697 [Conf ] Naveen Garg , Vijay V. Vazirani , Mihalis Yannakakis Approximate max-flow min-(multi)cut theorems and their applications. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:698-707 [Conf ] David P. Williamson , Michel X. Goemans , Milena Mihail , Vijay V. Vazirani A primal-dual approximation algorithm for generalized Steiner network problems. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:708-717 [Conf ] Jeff Edmonds Time-space trade-offs for undirected st-connectivity on a JAG. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:718-727 [Conf ] Greg Barnes , Uriel Feige Short random walks on graphs. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:728-737 [Conf ] Claire Kenyon , Dana Randall , Alistair Sinclair Matchings in lattice graphs. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:738-746 [Conf ] Leonard J. Schulman Deterministic coding for interactive communication. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:747-756 [Conf ] David R. Karger , Clifford Stein An O~(n^{2} ) algorithm for minimum cuts. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:757-765 [Conf ] James K. Park , Cynthia A. Phillips Finding minimum-quotient cuts in planar graphs. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:766-775 [Conf ] Cynthia A. Phillips The network inhibition problem. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:776-785 [Conf ] Sigal Ar , Manuel Blum , Bruno Codenotti , Peter Gemmell Checking approximate computations over the reals. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:786-795 [Conf ] Adi Shamir On the generation of multivariate polynomials which are hard to factor. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:796-804 [Conf ] Joachim von zur Gathen , Marek Karpinski , Igor Shparlinski Counting curves and their projections. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:805-812 [Conf ]