Conferences in DBLP
Amos Fiat , Yuval Rabani , Yiftach Ravid Competitive k-Server Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Sundar Vishwanathan Randomized Online Graph Coloring (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Sandy Irani Coloring Inductive Graphs On-Line [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Arvind Raghunathan Online Algorithms for Finger Searching (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Israel Cidon , Shay Kutten Communication-Optimal Maintenance of Replicated Information [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , David Peleg Sparse Partitions (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] Baruch Awerbuch , David Peleg Network Synchronization with Polylogarithmic Overhead [Citation Graph (0, 0)][DBLP ] Conf ] David Zuckerman General Weak Random Sources [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Oded Goldreich , Johan Håstad , René Peralta Simple Constructions of Almost k-Wise Independent Random Variables [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum Some Tools for Approximate 3-Coloring (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Mihir Bellare , Oded Goldreich , Shafi Goldwasser Randomness in Interactive Proofs [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Nimrod Megiddo Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time [Citation Graph (0, 0)][DBLP ] Conf ] Pravin M. Vaidya Reducing the Parallel Complexity of Certain Linear Programming Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Charles U. Martel , Ramesh Subramonian , Arvin Park Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs [Citation Graph (0, 0)][DBLP ] Conf ] Bowen Alpern , Larry Carter , Ephraim Feig Uniform Memory Hierarchies [Citation Graph (1, 0)][DBLP ] Conf ] Johan Håstad , Mikael Goldmann On the Power of Small-Depth Threshold Circuits [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao On ACC and Threshold Circuits [Citation Graph (0, 0)][DBLP ] Conf ] Roman Smolensky On Interpolation by Analytic Functions with Special Properties and Some Weak Lower Bounds on the Size of Circuits with Symmetric Gates [Citation Graph (0, 0)][DBLP ] Conf ] Jehoshua Bruck , Roman Smolensky Polynomial Threshold Functions, AC^0 Functions and Spectral Norms (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Mike Paterson , Nicholas Pippenger , Uri Zwick Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions [Citation Graph (0, 0)][DBLP ] Conf ] David Harel , Danny Raz Deciding Properties of Nonregular Programs (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Patrick Lincoln , John C. Mitchell , Andre Scedrov , Natarajan Shankar Decision Problems for Propositional Linear Logic [Citation Graph (0, 0)][DBLP ] Conf ] Oded Maler , Amir Pnueli Tight Bounds on the Complexity of Cascaded Decomposition of Automata [Citation Graph (0, 0)][DBLP ] Conf ] Michael Kaminski , Nissim Francez Finite-Memory Automata (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] James F. Lynch Probabilities of Sentences about Very Sparse Random Graphs [Citation Graph (1, 0)][DBLP ] Conf ] Dalit Naor , Dan Gusfield , Charles U. Martel A Fast Algorithm for Optimally Increasing the Edge-Connectivity [Citation Graph (0, 0)][DBLP ] Conf ] András Frank Augmenting Graphs to Meet Edge-Connectivity Requirements [Citation Graph (0, 0)][DBLP ] Conf ] Michael L. Fredman , Dan E. Willard Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths [Citation Graph (0, 0)][DBLP ] Conf ] Philip N. Klein , Ajit Agrawal , R. Ravi , Satish Rao Approximation through Multicommodity Flow [Citation Graph (0, 0)][DBLP ] Conf ] Shimon Even , Ami Litman , Peter Winkler Computing with Snakes in Directed Networks of Automata (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Amir Pnueli , Roni Rosner Distributed Reactive Systems Are Hard to Synthesize [Citation Graph (0, 0)][DBLP ] Conf ] Zhi-Quan Luo , John N. Tsitsiklis Communication Complexity of Algebraic Computation (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Ran Canetti , Oded Goldreich Bounds on Tradeoffs between Randomness and Communication Complexity [Citation Graph (0, 0)][DBLP ] Conf ] Seinosuke Toda The Complexity of Finding Medians [Citation Graph (0, 0)][DBLP ] Conf ] Samuel R. Buss , Christos H. Papadimitriou , John N. Tsitsiklis On the Predictability of Coupled Automata: An Allegory about Chaos [Citation Graph (1, 0)][DBLP ] Conf ] Christos H. Papadimitriou On Graph-Theoretic Lemmata and Complexity Classes (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Yuri Gurevich Matrix Decomposition Problem Is Complete for the Average Case [Citation Graph (0, 0)][DBLP ] Conf ] Russell Impagliazzo , Leonid A. Levin No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random [Citation Graph (0, 0)][DBLP ] Conf ] Antoni Koscielski , Leszek Pacholski Complexity of Unification in Free Groups and Free Semi-groups [Citation Graph (0, 0)][DBLP ] Conf ] Brigitte Vallée , Philippe Flajolet The Lattice Reduction Algorithm of Gauss: An Average Case Analysis [Citation Graph (0, 0)][DBLP ] Conf ] Dima Grigoriev , Marek Karpinski , Michael F. Singer Interpolation of Sparse Rational Functions Without Knowing Bounds on Exponents [Citation Graph (0, 0)][DBLP ] Conf ] Gwoboa Horng , Ming-Deh A. Huang Simplifying Nested Radicals and Solving Polynomials by Radicals in Minimum Depth [Citation Graph (0, 0)][DBLP ] Conf ] László Babai , Gábor Hetyei , William M. Kantor , Alexander Lubotzky , Ákos Seress On the Diameter of Finite Groups [Citation Graph (0, 0)][DBLP ] Conf ] Omer Berkman , Joseph JáJá , Sridhar Krishnamurthy , Ramakrishna Thurimella , Uzi Vishkin Some Triply-Logarithmic Parallel Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] 