Conferences in DBLP

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

1. Dan Boneh, Richard J. Lipton
   Effect of Operators on Straight Line Complexity. [Citation Graph (0, 0)][DBLP]
   ISTCS, 1997, pp:1-5 [Conf]
   
2. Bin Fu, Richard Beigel
   A Comparison of Resource-Bounded Molecular Computation Models. [Citation Graph (0, 0)][DBLP]
   ISTCS, 1997, pp:6-11 [Conf]
   
3. Gilles Brassard, Peter Høyer
   An Exact Quantum Polynomial-Time Algorithm for Simon's Problem. [Citation Graph (0, 0)][DBLP]
   ISTCS, 1997, pp:12-23 [Conf]
   
4. Takao Asano
   Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. [Citation Graph (0, 0)][DBLP]
   ISTCS, 1997, pp:24-37 [Conf]
   
5. Jaime Cohen, Claudio L. Lucchesi
   Minimax relations for T-join packing problems. [Citation Graph (0, 0)][DBLP]
   ISTCS, 1997, pp:38-44 [Conf]
   
6. Jeffrey Jackson, Eli Shamir, Clara Shwartzman
   Learning with Queries Corrupted by Classification Noise. [Citation Graph (0, 0)][DBLP]
   ISTCS, 1997, pp:45-53 [Conf]
   
7. Micah Adler, Yair Bartal, John W. Byers, Michael Luby, Danny Raz
   A Modular Analysis of Network Transmission Protocols. [Citation Graph (0, 0)][DBLP]
   ISTCS, 1997, pp:54-62 [Conf]
   
8. Mordecai J. Golin, Assaf Schuster
   Optimal point-to-point broadcast algorithms via lopsided trees. [Citation Graph (0, 0)][DBLP]
   ISTCS, 1997, pp:63-73 [Conf]
   
9. Yehuda Afek, Shlomi Dolev
   Local Stabilizer. [Citation Graph (0, 0)][DBLP]
   ISTCS, 1997, pp:74-84 [Conf]
   
10. Uriel Feige, Robert Krauthgamer
    Stereoscopic families of permutations, and their applications. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:85-95 [Conf]
    
11. Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks
    On the total_k-diameter of connection networks. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:96-106 [Conf]
    
12. Pat Frankel
    Exact Analysis of Exact Change. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:107-118 [Conf]
    
13. Yossi Azar, Leah Epstein
    On-Line Load Balancing of Temporary Tasks on Identical Machines. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:119-125 [Conf]
    
14. Ron Shamir, Dekel Tsur
    Faster subtree isomorphism. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:126-131 [Conf]
    
15. Christian Capelle, Michel Habib
    Graph decompositions and factorizing permutations. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:132-143 [Conf]
    
16. Richard Beigel
    Closure Properties of GapP and #P. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:144-146 [Conf]
    
17. Orna Kupferman, Moshe Y. Vardi
    Weak Alternating Automata Are Not That Weak. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:147-158 [Conf]
    
18. Richard Beigel, Richard Chang
    Commutative Queries. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:159-165 [Conf]
    
19. Vladimir Grebinski, Gregory Kucherov
    Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:166-173 [Conf]
    
20. Yuval Ishai, Eyal Kushilevitz
    Private Simultaneous Messages Protocols with Applications. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:174-184 [Conf]