4. ISTCS 1996:
Jerusalem,
Israel
Fourth Israel Symposium on Theory of Computing and Systems,
ISTCS 1996,
Jerusalem,
Israel,
June 10-12,
1996,
Proceedings. IEEE Computer Society,
1996,
ISBN 0-8186-7610-8
Session 1 - Invited Talk
- Frank Thomson Leighton:
How to Pick a Winner Almost Every Time: Provably-Good Algorithms for Decision Making in the Face of Uncertainty.
2
Session 2
- Nancy A. Lynch, Sergio Rajsbaum:
On the Borowsky-Gafni Simulation Algorithm.
4-15
- Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon:
Symmetry Breaking in Anonymous Networks: Characterizations.
16-26
- Shlomi Dolev, Evangelos Kranakis, Danny Krizanc:
Baked Potato Routing.
27-36
- Baruch Awerbuch, Yossi Azar, Amos Fiat:
Packet Routing via Min-Cost Circuit Routing.
37-42
Session 3 - Invited Talk
- Micha Sharir:
Arrangements of Curves and Surfaces in Computational Geometry.
44-50
Session 4
Session 5 - Invited Talk
Session 6
- Silvia M. Müller, Wolfgang J. Paul:
Making the Original Scoreboard Mechanism Deadlock Free.
92-99
- Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf:
Feasibility and Unfeasibility of Off-Line Processing.
100-109
- Judit Bar-Ilan, Guy Kortsarz, David Peleg:
Generalized Submodular Cover Problems and Applications.
110-118
- Amotz Bar-Noy, Hadas Shachnai, Tami Tamir:
On Chromatic Sums and Distributed Resource Allocation.
119-128
- Stuart W. Margolis, Mark V. Sapir, Pascal Weil:
On the Indecomposibility of Certain Language Classes.
129-134
Session 7
Session 8
Session 9 - Invited Talk
Session 10
Last update Fri May 25 08:24:25 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
