Conferences in DBLP
Bonnie Berger , John Rompel Simulating (log ^c n)-wise Independence in NC [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Motwani , Joseph Naor , Moni Naor The Probabilistic Method Yields Deterministic Parallel Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Aviad Cohen , Avi Wigderson Dispersers, Deterministic Amplification, and Weak Random Sources (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Alan Siegel On Universal Classes of Fast High Performance Hash Functions, Their Time-Space Tradeoff, and Their Applications (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Robert E. Schapire The Strength of Weak Learnability (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Ming Li , Paul M. B. Vitányi A Theory of Learning Simple Concepts Under Simple Distributions and Average Case Complexity for the Universal Distribution (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] David Haussler Generalizing the PAC Model: Sample Size Bounds From Metric Dimension-based Uniform Convergence Results [Citation Graph (0, 0)][DBLP ] Conf ] Sally A. Goldman , Ronald L. Rivest , Robert E. Schapire Learning Binary Relations and Total Orders (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Bonnie Berger , John Rompel , Peter W. Shor Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry [Citation Graph (0, 0)][DBLP ] Conf ] Odile Marcotte , Subhash Suri Fast Matching Algorithms for Points on a Polygon (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Greg N. Frederickson , D. J. Guan Ensemble Motion Planning in Trees [Citation Graph (0, 0)][DBLP ] Conf ] János Pach , William L. Steiger , Endre Szemerédi An Upper Bound on the Number of Planar k-Sets [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Dickerson The Inverse of an Automorphism in Polynomial Time [Citation Graph (0, 0)][DBLP ] Conf ] Joachim von zur Gathen Testing Permutation Polynomials (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] László Babai , Lajos Rónyai Computing Irreducible Representations of Finite Groups [Citation Graph (0, 0)][DBLP ] Conf ] Lajos Rónyai Galois Groups and Factoring Polynomials over Finite Fields [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow , Ying Xu Efficient Algorithms for Independent Assignments on Graphic and Linear Matroids [Citation Graph (0, 0)][DBLP ] Conf ] Gary L. Miller , Joseph Naor Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Cheriyan , Torben Hagerup A Randomized Maximum-Flow Algorithm [Citation Graph (0, 0)][DBLP ] Conf ] Nathan Linial , Umesh V. Vazirani Graph Products and Chromatic Numbers [Citation Graph (0, 0)][DBLP ] Conf ] Cheng Ng Lower Bounds for the Stable Marriage Problem and its Variants [Citation Graph (0, 0)][DBLP ] Conf ] Leslie A. Hall , David B. Shmoys Approximation Schemes for Constrained Scheduling Problems [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai , Yuri Gurevich Datalog vs. First-Order Logic [Citation Graph (7, 0)][DBLP ] Conf ] Martín Abadi , Joseph Y. Halpern Decidability and Expressiveness for First-Order Logics of Probability (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Stephen A. Cook , Bruce M. Kapron Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Leszek Pacholski , Wieslaw Szwast The 0-1 Law Fails for the Class of Existential Second Order Gödel Sentences with Equality [Citation Graph (1, 0)][DBLP ] Conf ] Rajeev Alur , Thomas A. Henzinger A Really Temporal Logic [Citation Graph (0, 0)][DBLP ] Conf ] James R. Russell Full Abstraction for Nondeterministic Dataflow Networks [Citation Graph (0, 0)][DBLP ] Conf ] S. Rao Kosaraju Efficient Tree Pattern Matching (Preliminary Version) [Citation Graph (2, 0)][DBLP ] Conf ] S. Rao Kosaraju Pipelining Computations in a Tree of Processors (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Michael T. Goodrich , S. Rao Kosaraju Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Omer Berkman , Uzi Vishkin Recursive *-Tree Parallel Data-Structure (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Ker-I Ko Computational Complexity of Roots of Real Functions (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Karl R. Abrahamson , John A. Ellis , Michael R. Fellows , Manuel E. Mata On the Complexity of Fixed Parameter Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Mark W. Krentel Structure in Locally Optimal Solutions (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Russell Impagliazzo , Gábor Tardos Decision Versus Search Problems in Super-Polynomial Time [Citation Graph (0, 0)][DBLP ] Conf ] Russell Impagliazzo , Michael Luby One-way Functions are Essential for Complexity Based Cryptography (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Russell Impagliazzo , Moni Naor Efficient Cryptographic Schemes Provably as Secure as Subset Sum [Citation Graph (0, 0)][DBLP ] Conf ] Michael Kharitonov , Andrew V. Goldberg , Moti Yung Lower Bounds for Pseudorandom Number Generators [Citation Graph (0, 0)][DBLP ] Conf ] Russell Impagliazzo , David Zuckerman How to Recycle Random Bits [Citation Graph (0, 0)][DBLP ] Conf ] Nick Littlestone , Manfred K. Warmuth The Weighted Majority Algorithm [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Maass , György Turán On the Complexity of Learning From Counterexamples (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Wen-Guey Tzeng The Equivalence and Learning of Probabilistic Automata (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Shahar Moses , Adi Shamir , Ilan Shimshoni , Gábor Tardos Planning and Learning in Permutation Groups [Citation Graph (0, 0)][DBLP ] Conf ] Vijaya Ramachandran , John H. Reif An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Samir Khuller , Baruch Schieber Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary) [Citation Graph (0, 0)][DBLP ] Conf ] Lefteris M. Kirousis , Maria J. Serna , Paul G. Spirakis The Parallel Complexity of the Subgraph Connectivity Problem [Citation Graph (0, 0)][DBLP ] Conf ] Samir Khuller , Stephen G. Mitchell , Vijay V. Vazirani Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao Lower Bounds for Algebraic Computation Trees with Integer Inputs [Citation Graph (0, 0)][DBLP ] Conf ] Susan Landau Simplification of Nested Radicals [Citation Graph (0, 0)][DBLP ] Conf ] Bettina Just Generalizing the Continued Fraction Algorithm to Arbitrary Dimensions [Citation Graph (0, 0)][DBLP ] Conf ] Yishay Mansour , Baruch Schieber , Prasoon Tiwari The Complexity of Approximating the Square Root (Extended Summary) [Citation Graph (0, 0)][DBLP ] Conf ] Pravin M. Vaidya Speeding-Up Linear Programming Using Fast Matrix Multiplication (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Pravin M. Vaidya A New Algorithm for Minimizing Convex Functions over Convex Sets (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] James R. Driscoll , Dennis M. Healy Jr. Asymptotically Fast Algorithms for Spherical and Related Transforms [Citation Graph (0, 0)][DBLP ] Conf ] Andrew V. Goldberg , Serge A. Plotkin , David B. Shmoys , Éva Tardos Interior-Point Methods in Parallel Computation [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Yishay Mansour , Nir Shavit Polynomial End-To-End Communication (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Andrew V. Goldberg , Michael Luby , Serge A. Plotkin Network Decomposition and Locality in Distributed Computation [Citation Graph (0, 0)][DBLP ] Conf ] Yehuda Afek , Eli Gafni , Moty Ricklin Upper and Lower Bounds for Routing Schemes in Dynamic Networks (Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Tao Jiang The Synchronization of Nonuniform Networks of Finite Automata (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Frank Thomson Leighton , Bruce M. Maggs Expanders Might Be Practical: Fast Algorithms for Routing Around Faults on Multibutterflies [Citation Graph (0, 0)][DBLP ] Conf ] Kieran T. Herley Efficient Simulations of Small Shared Memories on Bounded Degree Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] C. Greg Plaxton On the Network Complexity of Selection [Citation Graph (0, 0)][DBLP ] Conf ] Gene Itkis , Leonid A. Levin Power of Fast VLSI Models Is Insensitive to Wires' Thinness [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Juan A. Garay , Kenneth J. Perry Towards Optimal Distributed Consensus (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Kushilevitz Privacy and Communication Complexity [Citation Graph (0, 0)][DBLP ] Conf ] Benny Chor , Lior Moscovici Solvability in Asynchronous Environments (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Danny Dolev , Tomás Feder Multiparty Communication Complexity [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Di Battista , Roberto Tamassia Incremental Planarity Testing (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder Generating Random Spanning Trees [Citation Graph (0, 0)][DBLP ] Conf ] Greg N. Frederickson Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Elias Dahlhaus , Marek Karpinski An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Anne Condon , Richard J. Lipton On the Complexity of Space Bounded Interactive Proofs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Donald Beaver , Shafi Goldwasser Multiparty Computation with Faulty Majority (Extended Announcement) [Citation Graph (0, 0)][DBLP ] Conf ] Joe Kilian , Silvio Micali , Rafail Ostrovsky Minimum Resource Zero-Knowledge Proofs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Cynthia Dwork , Larry J. Stockmeyer On the Power of 2-Way Probabilistic Finite State Automata (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] David P. Dobkin , Subhash Suri Dynamically Computing the Maxima of Decomposable Functions, with Applications [Citation Graph (0, 0)][DBLP ] Conf ] Steven Fortune Stable Maintenance of Point Set Triangulations in Two Dimensions [Citation Graph (0, 0)][DBLP ] Conf ] Victor Milenkovic Double Precision Geometry: A General Technique for Calculating Line and Segment Intersections Using Rounded Arithmetic [Citation Graph (0, 0)][DBLP ] Conf ] Ruth Kuchem , Dorothea Wagner , Frank Wagner Area-Optimal Three-Layer Channel Routing [Citation Graph (0, 0)][DBLP ] Conf ] Seinosuke Toda On the Computational Power of PP and +P [Citation Graph (0, 0)][DBLP ] Conf ] Michael R. Fellows , Michael A. Langston An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Milena Mihail Conductance and Convergence of Markov Chains-A Combinatorial Treatment of Expanders [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai Lower Bounds for Constant Depth Circuits in the Presence of Help Bits [Citation Graph (0, 0)][DBLP ] Conf ] Cecilia R. Aragon , Raimund Seidel Randomized Search Trees [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Mehlhorn , Stefan Näher , Monika Rauch On the Complexity of a Game Related to the Dictionary Problem [Citation Graph (0, 0)][DBLP ] Conf ] Guy Jacobson Space-efficient Static Trees and Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Rajamani Sundar Twists, Turns, Cascades, Deque Conjecture, and Scanning Theorem [Citation Graph (0, 0)][DBLP ] Conf ] Ran Raz , Avi Wigderson Probabilistic Communication Complexity of Boolean Relations (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Richard J. Lipton Subquadratic Simulations of Circuits by Branching Programs [Citation Graph (0, 0)][DBLP ] Conf ] Nathan Linial , Yishay Mansour , Noam Nisan Constant Depth Circuits, Fourier Transform, and Learnability [Citation Graph (0, 0)][DBLP ] Conf ] Eric Allender A Note on the Power of Threshold Circuits [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra (Detailed Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Ketan Mulmuley On Obstructions in Relation to a Fixed Viewpoint [Citation Graph (0, 0)][DBLP ] Conf ] Mark H. Overmars , Micha Sharir Output-Sensitive Hidden Surface Removal [Citation Graph (0, 0)][DBLP ] Conf ] Mark D. Hansen Approximation Algorithms for Geometric Embeddings in the Plane with Applications to Parallel Processing Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Martin Fürer , Neil Immerman An Optimal Lower Bound on the Number of Variables for Graph Identification [Citation Graph (5, 0)][DBLP ] Conf ] Maciej Liskiewicz , Krzysztof Lorys On Reversal Complexity for Alternating Turing Machines (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Stephen A. Fenner , Stuart A. Kurtz , James S. Royer Every Polynomial-Time 1-Degree Collapses iff P=PSPACE [Citation Graph (0, 0)][DBLP ] Conf ] 