Conferences in DBLP
Leslie G. Valiant Cognitive Computation (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Satyanarayana V. Lokam Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Noam Nisan , Avi Wigderson Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Kenneth W. Regan , D. Sivakumar , Jin-yi Cai Pseudorandom Generators, Measure Theory, and Natural Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Armin Haken Counting Bottlenecks to Show Monotone P <=> NP. [Citation Graph (0, 0)][DBLP ] Conf ] Benny Chor , Oded Goldreich , Eyal Kushilevitz , Madhu Sudan Private Information Retrieval. [Citation Graph (0, 0)][DBLP ] Conf ] Jon M. Kleinberg , Éva Tardos Disjoint Paths in Densely Embedded Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Guy Even , Joseph Naor , Satish Rao , Baruch Schieber Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Randeep Bhatia , Samir Khuller , Joseph Naor The Loading Time Scheduling Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Leslie A. Hall Approximability of Flow Shop Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] András A. Benczúr A Representation of Cuts within 6/5 Times the Edge Connectivity with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Mike Paterson , Aravind Srinivasan Contention Resolution with Bounded Delay. [Citation Graph (0, 0)][DBLP ] Conf ] C. Greg Plaxton Tight Bounds for a Distributed Selection Game with Applications to Fixed-Connection Machines. [Citation Graph (0, 0)][DBLP ] Conf ] John H. Reif Efficient Parallel Solution of Sparse Eigenvalue and Eigenvector Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Pascal Koiran Approximating the Volume of Definable Sets. [Citation Graph (2, 0)][DBLP ] Conf ] Paul Dagum , Richard M. Karp , Michael Luby , Sheldon M. Ross An Optimal Algorithm for Monte Carlo Estimation (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Michael Luby , Dana Randall , Alistair Sinclair Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Mahajan , Ramesh Hariharan Derandomizing Semidefinite Programming Based Approximation Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Moni Naor , Omer Reingold Synthesizers and Their Application to the Parallel Construction of Psuedo-Random Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Moni Naor , Leonard J. Schulman , Aravind Srinivasan Splitters and Near-Optimal Derandomization. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Torng A Unified Analysis of Paging and Caching. [Citation Graph (0, 0)][DBLP ] Conf ] Rakesh D. Barve , Edward F. Grove , Jeffrey Scott Vitter Application-Controlled Paging for a Shared Cache (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Bala Kalyanasundaram , Kirk Pruhs Speed is as Powerful as Clairvoyance. [Citation Graph (0, 0)][DBLP ] Conf ] Mihalis Yannakakis Perspectives on Database Theory. [Citation Graph (2, 0)][DBLP ] Conf ] Herbert Edelsbrunner Algebraic Decompositions of Non-Convex Polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Dima Grigoriev , Marek Karpinski , Nicolai Vorobjov Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey , Sumanta Guha Optimal Algorithms for Curves on Surfaces. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander I. Barvinok Integral Geometry of Higher-Dimensional Polytopes and the Average Case in Combinatorial Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim von zur Gathen , Igor Shparlinski Finding Points on Curves over Finite Fields (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich , Ronitt Rubinfeld , Madhu Sudan Learning Polynomials with Queries: The Highly Noisy Case. [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty , Yishay Mansour Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Auer , Manfred K. Warmuth Tracking the Best Disjunction. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Auer , Nicolò Cesa-Bianchi , Yoav Freund , Robert E. Schapire Gambling in a Rigged Casino: The Adversarial Multi-Arm Bandit Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Yoav Freund , Michael J. Kearns , Yishay Mansour , Dana Ron , Ronitt Rubinfeld , Robert E. Schapire Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries. [Citation Graph (0, 0)][DBLP ] Conf ] Michael E. Saks , Shiyu Zhou RSPACE(S) \subseteq DSPACE(S3/2 ). [Citation Graph (0, 0)][DBLP ] Conf ] Mitsunori Ogihara Sparse P-Hard Sets Yield Space-Efficient Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , D. Sivakumar The Resolution of a Hartmanis Conjecture. [Citation Graph (0, 0)][DBLP ] Conf ] F. Frances Yao , Alan J. Demers , Scott Shenker A Scheduling Model for Reduced CPU Energy. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Yossi Azar , Edward F. Grove , Ming-Yang Kao , P. Krishnan , Jeffrey Scott Vitter Load Balancing in the Lp Norm. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Yishay Mansour , Adi Rosén , Orli Waarts Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Arora Reductions, Codes, PCPs, and Inapproximability. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Fürer Improved Hardness Results for Approximating the Chromatic Number. [Citation Graph (0, 0)][DBLP ] Conf ] Mihir Bellare , Oded Goldreich , Madhu Sudan Free Bits, PCPs and Non-Approximability - Towards Tight Results. [Citation Graph (0, 0)][DBLP ] Conf ] Mihir Bellare , Don Coppersmith , Johan Håstad , Marcos A. Kiwi , Madhu Sudan Linearity Testing in Characteristic Two. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Beigel , David Eppstein 3-Coloring in Time O(1.3446n ): A No-MIS Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Monika Rauch Henzinger , Thomas A. Henzinger , Peter W. Kopke Computing Simulations on Finite and Infinite Graphs. [Citation Graph (2, 0)][DBLP ] Conf ] C. R. Subramanian Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time. [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai , Nimrod Megiddo , Orli Waarts Improved Algorithms and Analysis for Secretary Problems and Generalizations. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Claude Latombe Controllability, Recognizability, and Complexity Issues in Robot Motion Planning. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Orlitsky , James R. Roche Coding for Computing. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Jeff Edmonds , Michael Luby Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Harry Buhrman , Lance Fortnow , Leen Torenvliet Using Autoreducibility to Separate Complexity Classes. [Citation Graph (0, 0)][DBLP ] Conf ] John Watrous On One-Dimensional Quantum Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Russell Impagliazzo Hard-Core Distributions for Somewhat Hard Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Milena Mihail , Christos Kaklamanis , Satish Rao Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Bruce M. Maggs , Ramesh K. Sitaraman Routing on Butterfly Networks with Random Faults. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Beigel , William Hurwood , Nabil Kahale Fault Diagnosis in a Flash. [Citation Graph (0, 0)][DBLP ] Conf ] Sridhar Hannenhalli , Pavel A. Pevzner Transforming Men into Mice (Polynomial Algorithm for Genomic Distance Problem). [Citation Graph (0, 0)][DBLP ] Conf ] Robert Beals Algorithms for Matrix Groups and the Tits Alternative. [Citation Graph (0, 0)][DBLP ] Conf ] Paolo Ferragina , Roberto Grossi Optimal On-Line Search and Sublinear Time Update in String Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Margaritis , Steven Skiena Reconstructing Strings from Substrings in Rounds. [Citation Graph (0, 0)][DBLP ] Conf ] Richard M. Karp , Orli Waarts , Geoffrey Zweig The Bit Vector Intersection Problem (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] S. Rao Kosaraju Faster Algorithms for the Construction of Parameterized Suffix Trees (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Michelangelo Grigni , Elias Koutsoupias , Christos H. Papadimitriou An Approximation Scheme for Planar Graph TSP. [Citation Graph (0, 0)][DBLP ] Conf ] Chris Okasaki Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking. [Citation Graph (0, 0)][DBLP ] Conf ] Arne Andersson Sublogarithmic Searching without Multiplications. [Citation Graph (0, 0)][DBLP ] Conf ] Monika Rauch Henzinger , Valerie King Fully Dynamic Biconnectivity and Transitive Closure. [Citation Graph (1, 0)][DBLP ] Conf ] Amos Beimel , Anna Gál , Mike Paterson Lower Bounds for Monotone Span Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Krause , Pavel Pudlák On Computing Boolean Functions by Sparse Real Polynomials. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Beame , Russell Impagliazzo , Toniann Pitassi Improved Depth Lower Vounds for Small Distance Connectivity. [Citation Graph (0, 0)][DBLP ] Conf ] Shay Kutten , David Peleg Tight Fault Locality (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Eric Schenk Faster Approximate Agreement with Multi-Writer Registers. [Citation Graph (0, 0)][DBLP ] Conf ] Zvi Galil , Alain J. Mayer , Moti Yung Resolving Message Complexity of Byzantine Agreement and beyond. [Citation Graph (0, 0)][DBLP ] Conf ] 