Conferences in DBLP
Sanjeev Arora Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems. [Citation Graph (1, 0)][DBLP ] Conf ] Alan M. Frieze , Ravi Kannan The Regularity Lemma and Approximation Schemes for Dense Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Arora , Alan M. Frieze , Haim Kaplan A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Claire Kenyon , Eric Rémila Approximate Strip Packing. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Dürr , Miklos Santha A Decision Procedure for Unitary Linear Quantum Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Dorit Aharonov , Michael Ben-Or Polynomial Simulations of Decohered Quantum Computers. [Citation Graph (0, 0)][DBLP ] Conf ] Peter W. Shor Fault-Tolerant Quantum Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Jon M. Kleinberg Single-Source Unsplittable Flow. [Citation Graph (0, 0)][DBLP ] Conf ] William H. Cunningham , James F. Geelen The Optimal Path-Matching Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Jon M. Kleinberg , Ronitt Rubinfeld Short Paths in Expander Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel A. Spielman , Shang-Hua Teng Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. [Citation Graph (1, 0)][DBLP ] Conf ] Grigory Kogan Computing Permanents over Fields of Characteristic 3: Where and Why It Becomes Difficult (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Deh A. Huang , Yiu-Chung Wong Solving Systems of Polynomial Congruences Modulo a Large Prime (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Dorit Dor , Uri Zwick Median Selection Requires (2+epsilon)n Comparisons. [Citation Graph (0, 0)][DBLP ] Conf ] Arne Andersson Faster Deterministic Sorting and Searching in Linear Space. [Citation Graph (0, 0)][DBLP ] Conf ] Vijay V. Vazirani , Huzur Saran , B. Sundar Rajan An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel A. Spielman Highly Fault-Tolerant Parallel Computation (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Madhu Sudan Maximum Likelihood Decoding of Reed Solomon Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Micah Adler New Coding Techniques for Improved Bandwidth Utilization. [Citation Graph (0, 0)][DBLP ] Conf ] Yair Bartal Probabilistic Approximations of Metric Spaces and Its Algorithmic Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Neal Madras , Dana Randall Factoring Graphs to Bound Mixing Rates. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Kannan , Guangxing Li Sampling According to the Multivariate Normal Density. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Mitzenmacher Load Balancing and Density Dependent Jump Markov Processes (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Anderson Tree Data Structures for N-Body Simulation. [Citation Graph (0, 0)][DBLP ] Conf ] Oren Etzioni , Steve Hanks , Tao Jiang , Richard M. Karp , Omid Madani , Orli Waarts Efficient Information Gathering on the Internet (extended abstract). [Citation Graph (1, 0)][DBLP ] Conf ] Prasad Chalasani , Somesh Jha , Isaac Saias Approximate Option Pricing. [Citation Graph (0, 0)][DBLP ] Conf ] Denis Thérien , Thomas Wilke Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Grohe Equivalence in Finite-Variable Logics is Complete for Polynomial Time. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Beame , Toniann Pitassi Simplified and Improved Resolution Lower Bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Michael O. Rabin Computationally Hard Algebraic Problems (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Cheriyan , Ramakrishna Thurimella Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Naveen Garg A 3-Approximation for the Minimum Tree Spanning k Vertices. [Citation Graph (0, 0)][DBLP ] Conf ] Guy Even , Joseph Naor , Leonid Zosin An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Süleyman Cenk Sahinalp , Uzi Vishkin Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , Alan M. Frieze , Ravi Kannan , Santosh Vempala A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich , Shafi Goldwasser , Dana Ron Property Testing and Its Connection to Learning and Approximation. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Beimel , Francesco Bergadano , Nader H. Bshouty , Eyal Kushilevitz , Stefano Varricchio On the Applications of Multiplicity Automata in Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Alan M. Frieze , Mark Jerrum , Ravi Kannan Learning Linear Transformations. [Citation Graph (0, 0)][DBLP ] Conf ] Friedhelm Meyer auf der Heide , Christian Scheideler Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Andrews , Baruch Awerbuch , Antonio Fernández , Jon M. Kleinberg , Frank Thomson Leighton , Zhiyong Liu Universal Stability Results for Greedy Contention-Resolution Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder , Alan M. Frieze , Eli Upfal A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Yuval Rabani Path Coloring on the Mesh. [Citation Graph (0, 0)][DBLP ] Conf ] Roy Armoni , Michael E. Saks , Avi Wigderson , Shiyu Zhou Discrepancy Sets and Pseudorandom Generators for Combinatorial Rectangles. [Citation Graph (0, 0)][DBLP ] Conf ] Manindra Agrawal , Thomas Thierauf The Boolean Isomorphism Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuyuki Amano , Akira Maruoka Potential of the Approximation Method (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Arne Andersson , Peter Bro Miltersen , Søren Riis , Mikkel Thorup Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient. [Citation Graph (0, 0)][DBLP ] Conf ] Dorit Dor , Shay Halperin , Uri Zwick All Pairs Almost Shortest Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Monika Rauch Henzinger , Satish Rao , Harold N. Gabow Computing Vertex Connectivity: New Bounds from Old Techniques. [Citation Graph (0, 0)][DBLP ] Conf ] Jeff Erickson Better Lower Bounds for Halfspace Emptiness. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Edward F. Grove , T. M. Murali , Jeffrey Scott Vitter Binary Search Partitions for Fat Rectangles. [Citation Graph (0, 0)][DBLP ] Conf ] Erez Petrank , Gábor Tardos On the Knowledge Complexity of NP. [Citation Graph (0, 0)][DBLP ] Conf ] Ran Canetti , Rosario Gennaro Incoercible Multiparty Computation (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Mihir Bellare , Ran Canetti , Hugo Krawczyk Pseudorandom Functions Revisited: The Cascade Construction and Its Concrete Security. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Dmitry N. Kozlov , Van H. Vu The Geometry of Coin-Weighing Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas M. Cover Universal Data Compression and Portfolio Selection. [Citation Graph (0, 0)][DBLP ] Conf ] Tracy Kimbrel , Anna R. Karlin Near-Optimal Parallel Prefetching and Caching. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Andrews , Michael A. Bender , Lisa Zhang New Algorithms for the Disk Scheduling Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Arge , Jeffrey Scott Vitter Optimal Dynamic Interval Management in External Memory (extended abstract). [Citation Graph (5, 0)][DBLP ] Conf ] C. Greg Plaxton , Rajmohan Rajaraman Fast Fault-Tolerant Concurrent Access to Shared Objects. [Citation Graph (0, 0)][DBLP ] Conf ] Yonatan Aumann , Michael A. Bender Fault Tolerant Data Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Funda Ergün , Ravi Kumar , Ronitt Rubinfeld Approximate Checking of Polynomials and Functional Equations (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Kumar , D. Sivakumar Efficient Self-Testing/Self-Correction of Linear Recurrences. [Citation Graph (0, 0)][DBLP ] Conf ] Sridhar Rajagopalan , Leonard J. Schulman Verifying Identities (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Luca Trevisan , Gregory B. Sorkin , Madhu Sudan , David P. Williamson Gadgets, Approximation, and Linear Programming (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad Clique is Hard to Approximate Within n1-epsilon . [Citation Graph (0, 0)][DBLP ] Conf ] 