The SCEAS System
Navigation Menu

Conferences in DBLP

Israel Symposium on Theory of Computing Systems (ISTCS) (istcs)
1995 (conf/istcs/1995)

  1. 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]
  2. 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]
  3. Ishai Ben-Aroya, Ilan Newman, Assaf Schuster
    Randomized Single-Target Hot-Potato Routing. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:20-29 [Conf]
  4. Uriel Feige
    Observations on Hot Potato Routing. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:30-39 [Conf]
  5. 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]
  6. 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]
  7. 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]
  8. Peter Høyer
    A General Technique for Implementation of Efficient Priority Queues. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:57-66 [Conf]
  9. 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]
  10. Matthew J. Katz
    Improved Algorithms in Geometric Optimization via Expanders. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:78-87 [Conf]
  11. Dorit Dor, Uri Zwick
    Finding percentile elements. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:88-97 [Conf]
  12. 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]
  13. Amir Ben-Dor, Amos Israeli, Asaf Shirazi
    Dynamic Counting. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:111-120 [Conf]
  14. Yaron Riany, Nir Shavit, Dan Touitou
    Towards A Practical Snapshot Algorithm. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:121-129 [Conf]
  15. 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]
  16. 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]
  17. H. Petersen
    Automata with Sensing Heads. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:150-157 [Conf]
  18. Pavel A. Pevzner, Michael S. Waterman
    Open Combinatorial Problems in Computational Molecular Biology. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:158-173 [Conf]
  19. Carsten Rössner, Claus-Peter Schnorr
    Computation of Highly Regular Nearby Points. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:174-181 [Conf]
  20. 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]
  21. Katalin Friedl, Madhu Sudan
    Some Improvements to Total Degree Tests. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:190-198 [Conf]
  22. 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]
  23. Joe Kilian, Moni Naor
    On the Complexity of Statistical Reasoning (extended abtract). [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:209-217 [Conf]
  24. Avi Wigderson
    Computational Pseudo-Randomness. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:218-219 [Conf]
  25. Tal Goldberg, Uri Zwick
    Optimal deterministic approximate parallel prefix sums and their applications. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:220-228 [Conf]
  26. 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]
  27. Jiri Sgall
    Randomized On-Line Scheduling of Parallel Jobs. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:241-250 [Conf]
  28. 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]
  29. 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]
  30. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002