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 ] Conf ] Ethan Bernstein , Umesh V. Vazirani Quantum complexity theory. [Citation Graph (0, 0)][DBLP ] 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 ] Conf ] Juan A. Garay , Yoram Moses Fully polynomial Byzantine agreement in t+1 rounds. [Citation Graph (0, 0)][DBLP ] Conf ] Ran Canetti , Tal Rabin Fast asynchronous Byzantine agreement with optimal resilience. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Ben-Or , Ran Canetti , Oded Goldreich Asynchronous secure computation. [Citation Graph (0, 0)][DBLP ] Conf ] Tao Jiang , Ming Li k one-way heads cannot do string-matching. [Citation Graph (0, 0)][DBLP ] Conf ] Brenda S. Baker A theory of parameterized pattern matching: algorithms and applications. [Citation Graph (0, 0)][DBLP ] Conf ] Ramana M. Idury , Alejandro A. Schäffer Multiple matching of rectangular patterns. [Citation Graph (0, 0)][DBLP ] Conf ] Elizabeth Borowsky , Eli Gafni Generalized FLP impossibility result for t-resilient asynchronous computations. [Citation Graph (0, 0)][DBLP ] Conf ] Michael E. Saks , Fotios Zaharoglou Wait-free k-set agreement is impossible: the topology of public knowledge. [Citation Graph (0, 0)][DBLP ] Conf ] Maurice Herlihy , Nir Shavit The asynchronous computability theorem for t-resilient tasks. [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou , Mihalis Yannakakis Linear programming without the matrix. [Citation Graph (0, 0)][DBLP ] Conf ] Ryan S. Borgstrom , S. Rao Kosaraju Comparison-based search in the presence of errors. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Farach , Sampath Kannan , Tandy Warnow A robust model for finding optimal evolutionary trees. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Felsner , Lorenz Wernisch Maximum k-chains in planar point sets: combinatorial structure and algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Kushilevitz , Yishay Mansour , Michael O. Rabin , David Zuckerman Lower bounds for randomized mutual exclusion. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Yair Bartal , Amos Fiat Competitive distributed file allocation. [Citation Graph (4, 0)][DBLP ] Conf ] Cynthia Dwork , Maurice Herlihy , Orli Waarts Contention in shared memory algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Moni Naor , Larry J. Stockmeyer What can be computed locally? [Citation Graph (0, 0)][DBLP ] 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 ] Conf ] Mario Szegedy , Sundar Vishwanathan Locality based graph coloring. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein , Zvi Galil , Giuseppe F. Italiano , Thomas H. Spencer Separator based sparsification for dynamic planar graph algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Leslie Ann Goldberg Polynomial space polynomial delay algorithms for listing families of graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender A linear time algorithm for finding tree-decompositions of small treewidth. [Citation Graph (3, 0)][DBLP ] Conf ] Noam Nisan , David Zuckerman More deterministic simulation in logspace. [Citation Graph (0, 0)][DBLP ] Conf ] Avi Wigderson , David Zuckerman Expanders that beat the eigenvalue bound: explicit construction and applications. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi B. Boppana , Babu O. Narayanan The biased coin problem. [Citation Graph (0, 0)][DBLP ] 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 ] Conf ] Daphne Koller , Nimrod Megiddo Constructing small sample spaces satisfying given constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Richard M. Karp Mapping the genome: some combinatorial problems arising in molecular biology. [Citation Graph (1, 0)][DBLP ] Conf ] Carsten Lund , Mihalis Yannakakis On the hardness of approximating minimization problems. [Citation Graph (1, 0)][DBLP ] Conf ] Mihir Bellare , Shafi Goldwasser , Carsten Lund , A. Russeli Efficient probabilistically checkable proofs and applications to approximations. [Citation Graph (0, 0)][DBLP ] 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 ] 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 ] Conf ] Angus Macintyre , Eduardo D. Sontag Finiteness results for sigmoidal "neural" networks. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Maass Bounds for the computational power and learning complexity of analog neural nets. [Citation Graph (0, 0)][DBLP ] 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 ] Conf ] Nicholas Pippenger Self-routing superconcentrators. [Citation Graph (0, 0)][DBLP ] Conf ] Robert D. Blumofe , Charles E. Leiserson Space-efficient scheduling of multithreaded computations. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Kharitonov Cryptographic hardness of distribution-specific learning. [Citation Graph (0, 0)][DBLP ] 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 ] Conf ] Michael J. Kearns Efficient noise-tolerant learning from statistical queries. [Citation Graph (0, 0)][DBLP ] Conf ] Steven Phillips , Jeffery Westbrook Online load balancing and network flow. [Citation Graph (0, 0)][DBLP ] 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 ] Conf ] Marshall W. Bern , Daniel H. Greene , Arvind Raghunathan On-line algorithms for cache sharing. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Di Battista , Luca Vismara Angles of planar triangular graphs. [Citation Graph (0, 0)][DBLP ] 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 ] Conf ] Michael Luby , Noam Nisan A parallel approximation algorithm for positive linear programming. [Citation Graph (0, 0)][DBLP ] 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 ] Conf ] Rudolf Fleischer Decision trees: old and new results. [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Matousek , Otfried Schwarzkopf A deterministic algorithm for the three-dimensional diameter problem. [Citation Graph (0, 0)][DBLP ] Conf ] John Hershberger , Subhash Suri Matrix searching with the shortest path metric. [Citation Graph (0, 0)][DBLP ] 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 ] Conf ] Mark de Berg , Jirí Matousek , Otfried Schwarzkopf Piecewise linear paths among convex obstacles. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Allender , Jia Jiao Depth reduction for noncommutative arithmetic circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Pavel Pudlák , Vojtech Rödl Modified ranks of tensors and the size of circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Mauricio Karchmer , Avi Wigderson Characterizing non-deterministic circuit size. [Citation Graph (0, 0)][DBLP ] Conf ] Russell Impagliazzo , Ramamohan Paturi , Michael E. Saks Size-depth trade-offs for threshold circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Mikael Goldmann , Marek Karpinski Simulating threshold circuits by majority circuits. [Citation Graph (0, 0)][DBLP ] 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 ] Conf ] Allan Borodin , Prabhakar Raghavan , Baruch Schieber , Eli Upfal How much can hardware help routing? [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Fan R. K. Chung , Ronald L. Graham Routing permutations on graphs via matchings. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Alur , Thomas A. Henzinger , Moshe Y. Vardi Parametric real-time reasoning. [Citation Graph (0, 0)][DBLP ] Conf ] Neil D. Jones Constant time factors do matter. [Citation Graph (0, 0)][DBLP ] Conf ] Tomás Feder , Moshe Y. Vardi Monotone monadic SNP and constraint satisfaction. [Citation Graph (4, 0)][DBLP ] 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 ] Conf ] William Aiello , Baruch Awerbuch , Bruce M. Maggs , Satish Rao Approximate load balancing on dynamic and asynchronous networks. [Citation Graph (0, 0)][DBLP ] Conf ] Anja Feldmann , Ming-Yang Kao , Jiri Sgall , Shang-Hua Teng Optimal online scheduling of parallel jobs with dependencies. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Shay Kutten , Yishay Mansour , Boaz Patt-Shamir , George Varghese Time optimal self-stabilizing synchronization. [Citation Graph (0, 0)][DBLP ] Conf ] Jason Cooper , Nathan Linial Fast perfection-information leader-election protocol with linear immunity. [Citation Graph (0, 0)][DBLP ] Conf ] Charles Rackoff , Daniel R. Simon Cryptographic defense against traffic analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Philip N. Klein , Serge A. Plotkin , Satish Rao Excluded minors, network decomposition, and multicommodity flow. [Citation Graph (0, 0)][DBLP ] Conf ] Serge A. Plotkin , Éva Tardos Improved bounds on the max-flow min-cut ratio for multicommodity flows. [Citation Graph (0, 0)][DBLP ] Conf ] Naveen Garg , Vijay V. Vazirani , Mihalis Yannakakis Approximate max-flow min-(multi)cut theorems and their applications. [Citation Graph (0, 0)][DBLP ] 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 ] Conf ] Jeff Edmonds Time-space trade-offs for undirected st-connectivity on a JAG. [Citation Graph (0, 0)][DBLP ] Conf ] Greg Barnes , Uriel Feige Short random walks on graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Claire Kenyon , Dana Randall , Alistair Sinclair Matchings in lattice graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Leonard J. Schulman Deterministic coding for interactive communication. [Citation Graph (0, 0)][DBLP ] Conf ] David R. Karger , Clifford Stein An O~(n2 ) algorithm for minimum cuts. [Citation Graph (0, 0)][DBLP ] Conf ] James K. Park , Cynthia A. Phillips Finding minimum-quotient cuts in planar graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Cynthia A. Phillips The network inhibition problem. [Citation Graph (0, 0)][DBLP ] Conf ] Sigal Ar , Manuel Blum , Bruno Codenotti , Peter Gemmell Checking approximate computations over the reals. [Citation Graph (0, 0)][DBLP ] Conf ] Adi Shamir On the generation of multivariate polynomials which are hard to factor. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim von zur Gathen , Marek Karpinski , Igor Shparlinski Counting curves and their projections. [Citation Graph (0, 0)][DBLP ] Conf ] 