Conferences in DBLP
Ashok K. Chandra , Larry J. Stockmeyer , Uzi Vishkin A Complexity Theory for Unbounded Fan-In Parallelism [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou On the Complexity of Unique Solutions [Citation Graph (0, 0)][DBLP ] Conf ] Thiet-Dung Huynh Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma_2^P-Complete [Citation Graph (0, 0)][DBLP ] Conf ] J. C. Lagarias The Computational Complexity of Simultaneous Diophantine Approximation Problems [Citation Graph (0, 0)][DBLP ] Conf ] Umesh V. Vazirani , Vijay V. Vazirani A Natural Encoding Scheme Proved Probabilistic Polynomial Complete [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Reisch , Georg Schnitger Three Applications of Kolmogorov-Complexity [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang J. Paul On-Line Simulation of k+1 Tapes by k Tapes Requires Nonlinear Time [Citation Graph (0, 0)][DBLP ] Conf ] Erich Kaltofen A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization [Citation Graph (0, 0)][DBLP ] Conf ] Allan Borodin , Joachim von zur Gathen , John E. Hopcroft Fast Parallel Matrix and GCD Computations [Citation Graph (0, 0)][DBLP ] Conf ] Carl Sturtivant Generalised Symmetries of Polynomials in Algebraic Complexity [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao Theory and Applications of Trapdoor Functions (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Benny Chor , Charles E. Leiserson , Ronald L. Rivest An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Leonard M. Adleman , Robert McDonnell An Application of Higher Reciprocity to Computational Number Theory (Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Narendra Karmarkar Probabilistic Analysis of Some Bin-Packing Problems [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Blum , Silvio Micali How to Generate Cryptographically Strong Sequences of Pseudo Random Bits [Citation Graph (0, 0)][DBLP ] Conf ] Zvi Galil , Christoph M. Hoffmann , Eugene M. Luks , Claus-Peter Schnorr , Andreas Weber An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Mark Jerrum A Compact Representation for Permutation Groups [Citation Graph (0, 0)][DBLP ] Conf ] Shafi Goldwasser , Silvio Micali , Po Tong Why and How to Establish a Private Code on a Public Network (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Adi Shamir A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem [Citation Graph (0, 0)][DBLP ] Conf ] Joan B. Plumstead Inferring a Sequence Generated by a Linear Congruence [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao Protocols for Secure Computations (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Michael L. Fredman , János Komlós , Endre Szemerédi Storing a Sparse Table with O(1) Worst Case Access Time [Citation Graph (2, 0)][DBLP ] Conf ] Kurt Mehlhorn On the Program Size of Perfect and Universal Hash Functions [Citation Graph (0, 0)][DBLP ] Conf ] Moshe Y. Vardi On Decomposition of Relational Databases [Citation Graph (8, 0)][DBLP ] Conf ] Colm Ó'Dúnlaing , Chee-Keng Yap Generic Transformation of Data Structures [Citation Graph (2, 0)][DBLP ] Conf ] Danny Dolev , Rüdiger Reischuk , H. Raymond Strong `Eventual' Is Earlier than `Immediate' [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Y. Halpern Deterministic Process Logic Is Elementary [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Pierre Queille , Joseph Sifakis A Temporal Logic to Deal with Fairness in Transition Systems [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama On Equations Including String Variables [Citation Graph (0, 0)][DBLP ] Conf ] Joffroy Beauquier , Michel Latteux Substitution of Bounded Rational Cone [Citation Graph (0, 0)][DBLP ] Conf ] Donald B. Johnson , Shankar M. Venkatesan Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Zvi Galil , Silvio Micali , Harold N. Gabow Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Moon-Jung Chung , Fillia Makedon , Ivan Hal Sudborough , Jonathan S. Turner Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees [Citation Graph (0, 0)][DBLP ] Conf ] Quentin F. Stout Using Clerks in Parallel Processing [Citation Graph (0, 0)][DBLP ] Conf ] John E. Hopcroft , Deborah Joseph , Sue Whitesides On the Movement of Robot Arms in 2-Dimensional Bounded Regions [Citation Graph (0, 0)][DBLP ] Conf ] John H. Reif Parallel Time O(log N) Acceptance of Deterministic CFLs [Citation Graph (0, 0)][DBLP ] Conf ] Frank Thomson Leighton , Charles E. Leiserson Wafer-Scale Integration of Systolic Arrays (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Narendra Karmarkar , Richard M. Karp An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem [Citation Graph (0, 0)][DBLP ] Conf ] Silvio Ursic The Ellipsoid Algorithm for Linear Inequalities in Exact Arithmetic [Citation Graph (0, 0)][DBLP ] Conf ] Boris Yamnitsky , Leonid A. Levin An Old Linear Programming Algorithm Runs in Polynomial Time [Citation Graph (0, 0)][DBLP ] Conf ] Nimrod Megiddo Linear-Time Algorithms for Linear Programming in R^3 and Related Problems [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle A Theorem on Polygon Cutting with Applications [Citation Graph (1, 0)][DBLP ] Conf ] Franco P. Preparata , Witold Lipski Jr. Three Layers Are Enough [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Lengauer The Complexity of Compacting Hierarchically Specified Layouts of Integrated Circuits (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Vijaya Ramachandran On Driving Many Long Lines in a VLSI Layout [Citation Graph (0, 0)][DBLP ] Conf ] Zvi M. Kedem Optimal Allocation of Computational Resources in VLSI [Citation Graph (0, 0)][DBLP ] Conf ] 