The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Frank Thomson Leighton
    How to Pick a Winner Almost Every Time: Provably-Good Algorithms for Decision Making in the Face of Uncertainty. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:2- [Conf]
  2. Nancy A. Lynch, Sergio Rajsbaum
    On the Borowsky-Gafni Simulation Algorithm. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:4-15 [Conf]
  3. Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon
    Symmetry Breaking in Anonymous Networks: Characterizations. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:16-26 [Conf]
  4. Shlomi Dolev, Evangelos Kranakis, Danny Krizanc
    Baked Potato Routing. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:27-36 [Conf]
  5. Baruch Awerbuch, Yossi Azar, Amos Fiat
    Packet Routing via Min-Cost Circuit Routing. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:37-42 [Conf]
  6. Micha Sharir
    Arrangements of Curves and Surfaces in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:44-50 [Conf]
  7. Y. B. Karasik
    On Advances in Optical Computational Models and Problems which They Help to Solve. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:52-60 [Conf]
  8. Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi
    On the Hardness of Approximating Max k-Cut and Its Dual. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:61-67 [Conf]
  9. Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan
    To Weight or Not to Weight: Where is the Question? [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:68-77 [Conf]
  10. Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin
    Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:78-88 [Conf]
  11. Shimon Ullman
    Visual Object Recognition. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:90- [Conf]
  12. Silvia M. Müller, Wolfgang J. Paul
    Making the Original Scoreboard Mechanism Deadlock Free. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:92-99 [Conf]
  13. Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
    Feasibility and Unfeasibility of Off-Line Processing. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:100-109 [Conf]
  14. Judit Bar-Ilan, Guy Kortsarz, David Peleg
    Generalized Submodular Cover Problems and Applications. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:110-118 [Conf]
  15. Amotz Bar-Noy, Hadas Shachnai, Tami Tamir
    On Chromatic Sums and Distributed Resource Allocation. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:119-128 [Conf]
  16. Stuart W. Margolis, Mark V. Sapir, Pascal Weil
    On the Indecomposibility of Certain Language Classes. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:129-134 [Conf]
  17. Michael Codish, Vitaly Lagoon
    Type Dependencies for Logic Programs Using ACI-Unification. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:136-145 [Conf]
  18. Thorsten Altenkirch, Martin Hofmann, Thomas Streicher
    Reduction-Free Normalisation for a Polymorphic System. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:146- [Conf]
  19. Cees Witteveen, Wiebe van der Hoek
    Updating Nonmonotonic Databases. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:147-153 [Conf]
  20. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    On the Parallel Computation of Boolean Functions on Unrelated inputs. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:155-161 [Conf]
  21. Richard Zippel
    On Satisfiability. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:162-169 [Conf]
  22. Yishay Mansour, Michal Parnas
    On Learning Conjunctions with Malicious Noise. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:170-175 [Conf]
  23. Moni Naor, Sitvanit Ruah
    On the Decisional Complexity of Problems Over the Reals. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:176-187 [Conf]
  24. William R. Pulleyblank
    The Airline Crew Pairing Optimization Problem. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:189- [Conf]
  25. Benny Chor, Yuval Ishai
    On Privacy and Partition Arguments. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:191-194 [Conf]
  26. Haim Kaplan, Ron Shamir
    Physical Maps and Interval Sandwich Problems: Bounded Degrees Help. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:195-201 [Conf]
  27. Roded Sharan, Avi Wigderson
    A New NCAlgorithm for Perfect Matching in Bipartite Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:202-207 [Conf]
  28. Uriel Feige, Yuri Rabinovich
    Deterministic Approximation of the Cover Time. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:208-218 [Conf]
  29. Israel A. Wagner, Michael Lindenbaum, Alfred M. Bruckstein
    Smell as a Computational Resource - A Lesson We Can Learn from the Ant. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:219-230 [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