Conferences in DBLP
Bernard Chazelle Polytope Range Searching and Integral Geometry (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Subir Kumar Ghosh , David M. Mount An Output Sensitive Algorithm for Computing Visibility Graphs [Citation Graph (0, 0)][DBLP ] Conf ] David P. Dobkin , Steven J. Friedman , Kenneth J. Supowit Delaunay Graphs are Almost as Good as Complete Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Herbert Edelsbrunner , János Pach , Jacob T. Schwartz , Micha Sharir On the Lower Envelope of Bivariate Functions and its Applications [Citation Graph (0, 0)][DBLP ] Conf ] John F. Canny A New Algebraic Method for Robot Motion Planning and Real Geometry [Citation Graph (0, 0)][DBLP ] Conf ] John F. Canny , John H. Reif New Lower Bound Techniques for Robot Motion Planning Problems [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Robert Roos Learning One-Counter Languages in Polynomial Time (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Nick Littlestone Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] Ronald L. Rivest , Robert E. Schapire Diversity-Based Inference of Finite Automata (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Vince Grolmusz , Prabhakar Ragde Incomparability in Parallel Computation [Citation Graph (0, 0)][DBLP ] Conf ] András Hajnal , Wolfgang Maass , Pavel Pudlák , Mario Szegedy , György Turán Threshold circuits of bounded depth [Citation Graph (0, 0)][DBLP ] Conf ] Yuri Gurevich Complete and Incomplete Randomized NP Problems [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Blum , Russell Impagliazzo Generic Oracles and Oracle Classes (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Joachim von zur Gathen , Dexter Kozen , Susan Landau Functional Decomposition of Polynomials [Citation Graph (0, 0)][DBLP ] Conf ] Lajos Rónyai Factoring Polynomials over Finite Fields [Citation Graph (0, 0)][DBLP ] Conf ] Michael Kaminski , Nader H. Bshouty Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Roland Mirwald , Claus-Peter Schnorr The Multiplicative Complexity of Quadratic Boolean Forms [Citation Graph (0, 0)][DBLP ] Conf ] Mikhail J. Atallah , Richard Cole , Michael T. Goodrich Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Mark K. Goldberg , Thomas H. Spencer A New Parallel Algorithm for the Maximal Independent Set Problem [Citation Graph (0, 0)][DBLP ] Conf ] Dima Grigoriev , Marek Karpinski The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents Is in NC (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Victor Y. Pan , John H. Reif Some Polynomial and Toeplitz Matrix Computations [Citation Graph (0, 0)][DBLP ] Conf ] Abhiram G. Ranade How to emulate shared memory (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Mihály Geréb-Graus , Danny Krizanc The Complexity of Parallel Comparison Merging [Citation Graph (0, 0)][DBLP ] Conf ] Alok Aggarwal , Ashok K. Chandra , Marc Snir Hierarchical Memory with Block Transfer [Citation Graph (2, 0)][DBLP ] Conf ] Jan Karel Lenstra , David B. Shmoys , Éva Tardos Approximation Algorithms for Scheduling Unrelated Parallel Machines [Citation Graph (0, 0)][DBLP ] Conf ] Satish Rao Finding Near Optimal Separators in Planar Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Hillel Gazit , Gary L. Miller A Parallel Algorithm for Finding a Separator in Planar Graphs [Citation Graph (0, 0)][DBLP ] Conf ] David W. Matula Determining Edge Connectivity in O(nm) [Citation Graph (0, 0)][DBLP ] Conf ] Arkady Kanevsky , Vijaya Ramachandran Improved Algorithms for Graph Four-Connectivity [Citation Graph (0, 0)][DBLP ] Conf ] Don Coppersmith , Prabhakar Raghavan , Martin Tompa Parallel Graph Algorithms that Are Efficient on Average [Citation Graph (0, 0)][DBLP ] Conf ] Ludek Kucera Canonical Labeling of Regular Graphs in Linear Average Time [Citation Graph (0, 0)][DBLP ] Conf ] Ravi B. Boppana Eigenvalues and Graph Bisection: An Average-Case Analysis (Extended Abstract) [Citation Graph (2, 0)][DBLP ] Conf ] Andrei Z. Broder , Eli Shamir On the Second Eigenvalue of Random Regular Graphs (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai Recursive Construction for 3-Regular Expanders [Citation Graph (0, 0)][DBLP ] Conf ] Joe Kilian , Shlomo Kipnis , Charles E. Leiserson The Organization of Permutation Architectures with Bussed Interconnections (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Shaodi Gao , Michael Kaufmann Channel Routing of Multiterminal Nets [Citation Graph (0, 0)][DBLP ] Conf ] Pavol Duris , Zvi Galil Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Nathan Linial Distributive Graph Algorithms-Global Solutions from Local Data [Citation Graph (0, 0)][DBLP ] Conf ] Hagit Attiya , Amotz Bar-Noy , Danny Dolev , Daphne Koller , David Peleg , Rüdiger Reischuk Achievable Cases in an Asynchronous Environment (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Yehuda Afek , Baruch Awerbuch , Serge A. Plotkin , Michael E. Saks Local Management of a Global Resource in a Communication Network [Citation Graph (0, 0)][DBLP ] Conf ] Yehuda Afek , Baruch Awerbuch , Eli Gafni Applying Static Network Protocols to Dynamic Networks [Citation Graph (0, 0)][DBLP ] Conf ] Amos Israeli , Ming Li Bounded Time-Stamps (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Gary L. Peterson , James E. Burns Concurrent Reading While Writing II: The Multi-writer Case [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao Lower Bounds to Randomized Algorithms for Graph Properties (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Michael D. Hirsch , Stephen A. Vavasis Exponential Lower Bounds for Finding Brouwer Fixed Points (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Stavros S. Cosmadakis Database Theory and Cylindric Lattices (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Jacques Stern Secret Linear Congruential Generators Are Not Cryptographically Secure [Citation Graph (0, 0)][DBLP ] Conf ] Paul Feldman A Practical Scheme for Non-interactive Verifiable Secret Sharing [Citation Graph (0, 0)][DBLP ] Conf ] William Aiello , Johan Håstad Perfect Zero-Knowledge Languages Can Be Recognized in Two Rounds [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich , Yishay Mansour , Michael Sipser Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Yair Oren On the Cunning Power of Cheating Verifiers: Some Observations about Zero Knowledge Proofs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Martin Tompa , Heather Woll Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information [Citation Graph (0, 0)][DBLP ] Conf ] Robert Endre Tarjan , Christopher J. Van Wyk Correction to ``A Linear-Time Algorithm for Triangulating Simple Polygons'' [Citation Graph (0, 0)][DBLP ] Conf ] Paul M. B. Vitányi , Baruch Awerbuch Errata to ``Atomic Shared Register Access by Asynchronous Hardware'' [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Yossi Azar The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] 