Conferences in DBLP
G. Gemünd , M. Jakob , Werner Massonne , Wolfgang J. Paul , B. Spengler High Performance Transaction Systems on the SB-PRAM. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:1-10 [Conf ] Artur Czumaj , Friedhelm Meyer auf der Heide , Volker Stemann Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:11-19 [Conf ] Ishai Ben-Aroya , Ilan Newman , Assaf Schuster Randomized Single-Target Hot-Potato Routing. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:20-29 [Conf ] Uriel Feige Observations on Hot Potato Routing. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:30-39 [Conf ] Nikolai K. Vereshchagin NP-sets are Co-NP-immune Relative to a Random Oracle. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:40-45 [Conf ] Nikolai K. Vereshchagin Lower Bounds for Perceptrons Solving some Separation Problems and Oracle Separation of AM from PP. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:46-51 [Conf ] Gábor Tardos , David A. Mix Barrington A Lower Bound on the Mod 6 Degree of the OR Function. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:52-56 [Conf ] Peter Høyer A General Technique for Implementation of Efficient Priority Queues. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:57-66 [Conf ] Jeanette P. Schmidt All Shortest Paths in Weighted Grid Graphs and its Application to Finding All Approximate Repeats in Strings. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:67-77 [Conf ] Matthew J. Katz Improved Algorithms in Geometric Optimization via Expanders. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:78-87 [Conf ] Dorit Dor , Uri Zwick Finding percentile elements. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:88-97 [Conf ] Hagit Brit , Shlomo Moran , Gadi Taubenfeld Public Data Structures: Counters as a Special Case (Abridged Version). [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:98-110 [Conf ] Amir Ben-Dor , Amos Israeli , Asaf Shirazi Dynamic Counting. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:111-120 [Conf ] Yaron Riany , Nir Shavit , Dan Touitou Towards A Practical Snapshot Algorithm. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:121-129 [Conf ] Rob Gerth , Ruurd Kuiper , Doron Peled , Wojciech Penczek A Partial Order Approach to Branching Time Logic Model Checking. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:130-139 [Conf ] David Harel , Eli Singerman More on Nonregular PDL: Expressive Power, Finite Models, Fibonacci Programs. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:140-149 [Conf ] H. Petersen Automata with Sensing Heads. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:150-157 [Conf ] Pavel A. Pevzner , Michael S. Waterman Open Combinatorial Problems in Computational Molecular Biology. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:158-173 [Conf ] Carsten Rössner , Claus-Peter Schnorr Computation of Highly Regular Nearby Points. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:174-181 [Conf ] Uriel Feige , Michel X. Goemans Aproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:182-189 [Conf ] Katalin Friedl , Madhu Sudan Some Improvements to Total Degree Tests. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:190-198 [Conf ] Mihir Bellare , Uriel Feige , Joe Kilian On the Role of Shared Randomness in Two Prover Proof Systems. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:199-208 [Conf ] Joe Kilian , Moni Naor On the Complexity of Statistical Reasoning (extended abtract). [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:209-217 [Conf ] Avi Wigderson Computational Pseudo-Randomness. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:218-219 [Conf ] Tal Goldberg , Uri Zwick Optimal deterministic approximate parallel prefix sums and their applications. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:220-228 [Conf ] Omer Berkman , Phillip B. Gibbons , Yossi Matias On the Power of Randomization for the Common PRAM. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:229-240 [Conf ] Jiri Sgall Randomized On-Line Scheduling of Parallel Jobs. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:241-250 [Conf ] Shlomo Moran Using Approximate Agreement to Obtain Complete Disagreement: The Output Structure of Input-Free Asynchronous Computations. [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:251-257 [Conf ] Jon M. Kleinberg , Hagit Attiya , Nancy A. Lynch Trade-offs between Message Delivery and Quiesce Times in Conection Management Protocols (Preliminary Report). [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:258-267 [Conf ] Alain J. Mayer , Moni Naor , Larry J. Stockmeyer Local Computations on Static and Dynamic Graphs (Preliminary Version). [Citation Graph (0, 0)][DBLP ] ISTCS, 1995, pp:268-278 [Conf ]