Conferences in DBLP
Paul Beame , Stephen A. Cook , H. James Hoover Log Depth Circuits for Division and Related Problems [Citation Graph (0, 0)][DBLP ] Conf ] Ravindran Kannan , Gary L. Miller , Larry Rudolph Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers [Citation Graph (0, 0)][DBLP ] Conf ] Robert Endre Tarjan , Uzi Vishkin Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) [Citation Graph (1, 0)][DBLP ] Conf ] Wayne Eberly Very Fast Parallel Matrix and Polynomial Arithmetic [Citation Graph (0, 0)][DBLP ] Conf ] Joachim von zur Gathen Parallel Powering [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Adi Shamir Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers [Citation Graph (0, 0)][DBLP ] Conf ] Oscar H. Ibarra , Michael A. Palis , Sam M. Kim Designing Systolic Algorithms Using Sequential Machines [Citation Graph (0, 0)][DBLP ] Conf ] Friedhelm Meyer auf der Heide , Rüdiger Reischuk On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Alan Siegel River Routing Every Which Way, but Loose (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Lenwood S. Heath Embedding Planar Graphs in Seven Pages [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou , Jeffrey D. Ullman A Communication-Time Tradeoff [Citation Graph (0, 0)][DBLP ] Conf ] Alok Aggarwal A Comparative Study of X-Tree, Pyramid and Related Machines [Citation Graph (0, 0)][DBLP ] Conf ] Abbas El Gamal , Alon Orlitsky Interactive Data Comparison [Citation Graph (0, 0)][DBLP ] Conf ] Prasoon Tiwari Lower Bounds on Communication Complexity in Distributed Computer Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Ramamohan Paturi , Janos Simon Probabilistic Communication Complexity (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Nicholas Pippenger Parallel Communication with Limited Buffers (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Alon Itai , Michael Rodeh The Multi-Tree Approach to Reliability in Distributed Networks [Citation Graph (0, 0)][DBLP ] Conf ] Gregory F. Sullivan A Polynomial Time Algorithm for Fault Diagnosability [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder , Danny Dolev Flipping coins in many pockets (Byzantine agreement on uniformly random values) [Citation Graph (0, 0)][DBLP ] Conf ] Eli Upfal , Avi Wigderson How to Share Memory in a Distributed System (A Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Thang Bui , Soma Chaudhuri , Frank Thomson Leighton , Michael Sipser Graph Bisection Algorithms with Good Average Case Behavior [Citation Graph (0, 0)][DBLP ] Conf ] Peter W. Shor The Average-Case Analysis of Some On-Line Algorithms for Bin Packing [Citation Graph (0, 0)][DBLP ] Conf ] János Komlós Linear Verification for Spanning Trees [Citation Graph (0, 0)][DBLP ] Conf ] Bhubaneswar Mishra An Efficient Algorithm to Find all `Bidirectional' Edges of an Undirected Graph [Citation Graph (0, 0)][DBLP ] Conf ] Matthias F. M. Stallmann , Harold N. Gabow An Augmenting Path Algorithm for the Parity Problem on Linear Matroids [Citation Graph (0, 0)][DBLP ] Conf ] László Babai , Endre Szemerédi On the Complexity of Matrix Group Problems I [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Kornhauser , Gary L. Miller , Paul G. Spirakis Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications [Citation Graph (0, 0)][DBLP ] Conf ] Michael Kaminski Mulltiplication of Polynomials over the Ring of Integers [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Lenore Blum , Mike Shub Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Ronald Fagin , Joseph Y. Halpern , Moshe Y. Vardi A Model-Theoretic Analysis of Knowledge: Preliminary Report [Citation Graph (1, 0)][DBLP ] Conf ] Ketan Mulmuley A Semantic Characterization of Full Abstraction for Typed Lambda Calculi [Citation Graph (0, 0)][DBLP ] Conf ] John C. Mitchell Semantic Models for Second-Order Lambda Calculus [Citation Graph (0, 0)][DBLP ] Conf ] Steven Homer Minimal Degrees for Honest Polynomial Reducibilities [Citation Graph (0, 0)][DBLP ] Conf ] José L. Balcázar , Ronald V. Book , Timothy J. Long , Uwe Schöning , Alan L. Selman Sparse Oracles and Uniform Complexity Classes [Citation Graph (0, 0)][DBLP ] Conf ] Sergiu Hart , Micha Sharir Nonlinearity of Davenport-Schinzel Sequences and of a Generalized Path Compression Scheme [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , V. D. Milman Eigenvalues, Expanders and Superconcentrators (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Albert G. Greenberg , Alan Weiss A Lower Bound for Probabilistic Algorithms for Finite State Machines [Citation Graph (0, 0)][DBLP ] Conf ] Shlomo Moran , Marc Snir , Udi Manber Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Michael L. Fredman , Robert Endre Tarjan Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow , Zvi Galil , Thomas H. Spencer Efficient Implementation of Graph Algorithms Using Contraction [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle Computing on a Free Tree via Complexity-Preserving Mappings [Citation Graph (0, 0)][DBLP ] Conf ] J. Ian Munro An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time [Citation Graph (0, 0)][DBLP ] Conf ] Michael J. Fischer , Mike Paterson Fishspear: A Priority Queue Algorithm (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] David P. Dobkin , Herbert Edelsbrunner Space Searching for Intersecting Objects [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Imai , Takao Asano Dynamic Segment Intersection Search with Applications [Citation Graph (0, 0)][DBLP ] Conf ] Pravin M. Vaidya A fast approximation for minimum spanning trees in k-dimensional space [Citation Graph (0, 0)][DBLP ] Conf ] Jyun-Sheng Chang , Chee-Keng Yap A Polynomial Solution for Potato-peeling and other Polygon Inclusion and Enclosure Problems [Citation Graph (0, 0)][DBLP ] Conf ] Robert Sedgewick , Jeffrey Scott Vitter Shortest Paths in Euclidean Graphs (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] Manuel Blum Independent Unbiased Coin Flips From a Correlated Biased Source: a Finite State Markov Chain [Citation Graph (0, 0)][DBLP ] Conf ] Miklos Santha , Umesh V. Vazirani Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Shafi Goldwasser , Silvio Micali , Ronald L. Rivest A ``Paradoxical'' Solution to the Signature Problem (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Werner Alexi , Benny Chor , Oded Goldreich , Claus-Peter Schnorr RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure [Citation Graph (0, 0)][DBLP ] Conf ] Umesh V. Vazirani , Vijay V. Vazirani Efficient and Secure Pseudo-Random Number Generation (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich , Shafi Goldwasser , Silvio Micali How to Construct Random Functions (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Alan M. Frieze , Ravi Kannan , J. C. Lagarias Linear Congruential Generators Do Not Produce Random Sequences [Citation Graph (0, 0)][DBLP ] Conf ] Leonard Pitt A Characterization of Probabilistic Inference [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Grollmann , Alan L. Selman Complexity Measures for Public-Key Cryptosystems (Preliminary Report) [Citation Graph (0, 0)][DBLP ] Conf ] J. Friedman Constructing O(n log n) Size Monotone Formulae for the k-th Elementary Symmetric Polynomial of n Boolean Variables [Citation Graph (0, 0)][DBLP ] Conf ] 