The Community for Technology Leaders
Theory of Computing Systems, Israel Symposium on the (1995)
Tel Aviv, Israel
Jan. 4, 1995 to Jan. 6, 1995
ISBN: 0-8186-6915-2
TABLE OF CONTENTS

Foreword (PDF)

pp. viii

Sponsors (PDF)

pp. x
Invited Talk
Session 1: D. Peleg, Chair

Randomized single-target hot-potato routing (Abstract)

I.B. Aroya , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
I. Newman , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
A. Schuster , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
pp. 0020

Observations on hot potato routing (Abstract)

U. Feige , Dept. of Appl. Math. & Comput. Sci., Weizmann Inst., Rehovot, Israel
pp. 0030
Session 2: R. Shamir, Chair

NP-sets are Co-NP-immune relative to a random oracle (Abstract)

N.K. Vereshchagin , Dept. of Math. Logic, Moscow State Univ., Russia
pp. 0040
Session 3: S. Klein, Chair

A general technique for implementation of efficient priority queues (Abstract)

P. Hoyer , Dept. of Math. & Comput. Sci., Odense Univ., Denmark
pp. 0057
Session 4: M. Naor, Chir

Improved algorithms in geometric optimization via expanders (Abstract)

M.J. Katz , Inst. Nat. de Recherche en Inf. et Autom., Sophia-Antipolis, France
pp. 0078

Finding percentile elements (Abstract)

D. Dor , Dept. of Comput. Sci., Tel Aviv Univ., Israel
U. Zwick , Dept. of Comput. Sci., Tel Aviv Univ., Israel
pp. 0088
Invited Talk
Session 5: O. Shmueli, Chair

Public data structures: counters as a special case (Abstract)

H. Brit , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
S. Moran , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
G. Taubenfeld , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
pp. 0098

Dynamic counting (Abstract)

A. Ben-Dor , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
A. Israeli , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
A. Shirazi , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
pp. 0111

Towards a practical snapshot algorithm (Abstract)

Y. Riany , Tel Aviv Univ., Israel
N. Shavit , Tel Aviv Univ., Israel
D. Touitou , Tel Aviv Univ., Israel
pp. 0121
Session 6: O. Grumberg, Chair

A partial order approach to branching time logic model checking (Abstract)

R. Gerth , Eindhoven Univ. of Technol., Netherlands
R. Kuiper , Eindhoven Univ. of Technol., Netherlands
D. Peled , Eindhoven Univ. of Technol., Netherlands
W. Penczek , Eindhoven Univ. of Technol., Netherlands
pp. 0130

Automata with sensing heads (Abstract)

H. Petersen , Fachbereich Inf., Hamburg Univ., Germany
pp. 0150
Invited Paper
Session 7: J. Schmidt, Chair

Computation of highly regular nearby points (Abstract)

C. Rossner , Dept. of Math. & Comput. Sci., Frankfurt Univ., Germany
C.P. Schnorr , Dept. of Math. & Comput. Sci., Frankfurt Univ., Germany
pp. 0174

Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT (Abstract)

U. Feige , Dept. of Appl. Math. & Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
M. Goemans , Dept. of Appl. Math. & Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
pp. 0182
Session 8: R. Roth, Chair

Some improvements to total degree tests (Abstract)

K. Friedl , Comput. & Autom. Inst., Hungarian Acad. of Sci., Budapest, Hungary
M. Sudan , Comput. & Autom. Inst., Hungarian Acad. of Sci., Budapest, Hungary
pp. 0190

On the complexity of statistical reasoning (Abstract)

J. Kilian , NEC Res. Inst., Princeton, NJ, USA
M. Naor , NEC Res. Inst., Princeton, NJ, USA
pp. 0209
Invited Talk
Session 9: M. Sharir, Chair

Optimal deterministic approximate parallel prefix sums and their applications (Abstract)

T. Goldberg , Dept. of Comput. Sci., Tel Aviv Univ., Israel
U. Zwick , Dept. of Comput. Sci., Tel Aviv Univ., Israel
pp. 0220

On the power of randomization for the common PRAM (Abstract)

O. Berkman , Algorithmic Res. Ltd., Givaat Shmuel, Israel
P.B. Gibbons , Algorithmic Res. Ltd., Givaat Shmuel, Israel
Y. Matias , Algorithmic Res. Ltd., Givaat Shmuel, Israel
pp. 0229

Randomized on-line scheduling of parallel jobs (Abstract)

J. Sgall , Mathematical Inst., Praha, Czech Republic
pp. 0241
Session 10: N. Linial, Chair

Using approximate agreement to obtain complete disagreement: the output structure of input-free asynchronous computations (Abstract)

S. Moran , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
pp. 0251

Trade-offs between message delivery and quiesce times in connection management protocols (Abstract)

J. Kleinberg , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
H. Attiya , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
N. Lynch , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 0258

Local computations on static and dynamic graphs (Abstract)

A. Mayer , Dept. of Comput. Sci., Columbia Univ., New York, NY, USA
M. Naor , Dept. of Comput. Sci., Columbia Univ., New York, NY, USA
L. Stockmeryer , Dept. of Comput. Sci., Columbia Univ., New York, NY, USA
pp. 0268

Author Index (PDF)

pp. 0279
97 ms
(Ver )