1990 CS Technical Reports
This is a partial list
- CS0601
E. Korach, N. SoleI and A. Tal:
ON DISJOINT PATHS PROBLEM$ IN GRAPHS (Extended Version of TR#585)
- CS0602
Oded Goldreich:
A note on computational indistinguishability
- CS0603
R.Y. Geva and A. Paz:
REPRESENTATION Of IRRELEVANCE RELATIONS BY ANNOTATED GRAPHS
- CS0604
Shimon Even and Yachin Pnueli:
HOW TO KEEP B A DYNAMIC DISTRIBUTIVE DIRECTED GRAPH ACYCLIC A AND YET GRANT ALL REQUESTS OF EDGE ADDITIONS
- CS0605
N. Kiryati and A.M. Bruckstein:
WHAT'S IN A SET OF POINTS?
- CS0606
R. Cohen and A. Segall:
AN EFFICIENT PRIORITY MECHANISM FOR RINGS
- CS0607
S. Ben-David and A. Borodin:
A New Measure for the Study of Online Algorithms
- CS0608
G. Matsliach and O. Shmue1i:
A COMBINED METHOD FOR MAINTAINING INDICES IN MULTIPROCESSER MULTI-DISK ENVIRONMENTS
- CS0609
Michael Yoeli:
NET-BASED SYNTHESIS OF DELAY-INSENSITIVE CIRCUITS
- CS0610
Oded Goldreich and Yair Oren:
DEFINITIONS AND PROPERTIES OF ZERO-KNOWLEDGE PROOF SYSTEMS
- CS0611
E. Korach and M. Penn:
TIGHT INTEGRAL DUALITY GAP IN THE CHINESE POSTMAN PROBLEM
- CS0612
E. Korach and Z. Ostfeld:
ON THE EXISTENGE OF SPECIAL DFS-TREES
- CS0613
E. Korach and A. Tal:
GENERAL VERTEX DISJOINT PATHS IN SERIES-PARALLEL GRAPHS
- CS0614
O. Biran, S. Moran ahd S. Zaks:
TIiE ROUND COMPLEXITY OF 1-S0LVABLE TASKS
- CS0615
o. Goldreich, S. Micali, and A. Wigderson:
PROOFS THAT YIELD ~OTHING BUT THEIR VALIDITY or ALL LANGUAGES IN NP HAVE ZERO-KNOWLEDGE PROOF SYSTEMS (Revised Version o£ TR~ 498 & 544)
- CS0616
A.M. Bruckstein:
SELF-SIMILARITY PROPERTIES OF DIGITIZED STRAIGHT LINES
- CS0617
E. Korach and M. Penn:
ON SEYMOUR'S AND LOMONOSOV'S PLANE INTEGRAL TWO COMMODITY FLOW RESULTS
- CS0618
Tuvi Etzion:
NEW LOWER BOUNDS FOR ASYMMETRIC AND UNIDIRECTIONAL CODES
- CS0619
G. Matz1iach and O. Shmue1i:
THE COMPETITIVENESS OF ON-LINE DEMAND PAGING ALGORITHMS FOR GENERALIZED TWO LEVEL MEMORIES (Preliminary Version)
- CS0620
Avram Sidi:
EFFICIENT IMPLEMENTATION OF MINIMAL POLYNOMIAL AND REDUCED RANK EXTRAPOLATION METHODS
- CS0621
G. Mats1iach and o. Shmue1i:
MAINTAINING BOUNDED DISORDER FILES IN MULTIPROCESSOR MULTI-DISK ENVIRONMENTS
- CS0622
D. Shaked, J. Koplowitz and A.M. Bruckst~~n:
STAR SHAPEDNE OF DIGITIZED PLANAR SHAPES
- CS0623
s. Bitan and S. Zaks:
OPTIMAL LINEAR BROADCAST
- CS0624
B. Awerbuch, O. Goldreich, A. Herzberg:
A QUANTITATIVE APPROACH TO DYNAMIC NETWORKS
- CS0625
R. Cohen and A. Segall:
A MAC PROTOCOL FOR ROUTE DETERMINATION IN MULTIPLE-RING NETWORKS
- CS0626
I. Dagan and A. Itai:
AUTOMATIC ACQUISITION OF CONSTRAINTS FOR THE RESOLUTION OF ANAPHORA REFERENCES AND SYNTACTIC AMBIGUITIES
- CS0627
Oded Go1dreich:
A UNIFORM-COMPLEXITY TREATMENT OF ENCRYPTION AND ZERO-KNOWLEDGE (Revised Version of TR568)
- CS0628
Shmuel Ka~z and Doron Pe1ed:
DEFINING CONDITIONAL INDEPENDENCE USING COLLAPSES
- CS0629
Avram Sidi:
DEVELOPMENT OF NEW ITERATIVE TECHNIQUE AND EXTRAPOLATION "METHODS FOR CONSISTENT OR INCONSISTENT SINGULAR LINEAR SYSTEMS
- CS0630
Rina Dechter:
FROM LOCAL TO GLOBAL C.ONSISTENCY
- CS0631
B. Chor, O. Goldreich,and J. Hastad:
THE RANDOM-ORACLE HYPOTHESIS IS FALSE
- CS0632
E. Korach and N. Solel:
Linear Time Algorithm for Minimum Weight Steiner Tree in Graphs with Bounded Tree-width
- CS0633
Snmuel Katz and Doron Peled:
VERIFICATION OF 'DISTRIBUTED PROGRAMS ~SING REPRESENTATIVE INTERLEAVING SEQUENCES
- CS0634
O. Goldreich and E. Petrank:
THE BEST OF BOTH WORLDS: GUARANTEEING TERMINATION IN FAST RANDOMIZED BYZANTINE AGREEMENT PROTOCOLS
- CS0635
S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson:
ON THE POWER OF RANDOMIZATION IN ONLINE ALGORITHMS
- CS0636
G. Matsliach:
PERFORMANCE ANALYSIS OF FILE ORGANIZATIONS THAT USE MULTI-BUCKET DATA LEAVES
- CS0637
G. Matsliach and O. Shmueli:
A FRAMEWORK FOR DISTRIBUTING AND PARALLELIZING SECONDARY MEM8RY SEARCH STRUCTURES
- CS0638
O. Goldreich and J. Hastad:
A SIHPLE CONSTRUCTION OF ALMOST k-Wise INDEPENDENT RANDOM VARIABLES
- CS0639
R~ Bar-Yehuda and S. Fogel:
VARIATIONS ON RAY SHOOTING
- CS0640
R. Bar-Yehu9a anq S. Fogel:
P,ARTITl.ONING A SEQUENCF INTO FEW MONOTONE SUBSEQUENCES
- CS0641
s. Dolev, A. Israeli, and S. Moran:
R$SOURCE BOUNDS .FOR SELF STABILIZING MESSAGE DRIVEN PROTOCOLS
- CS0642
R. Cohen and A. Segall:
A NEW SCHEME FOR DYNAMIC MANAGEMENT OF ISOCHRONOUS CHANNELS IN INTEGRATED RINGS
- CS0643
Gabriel Matsliach:
PERFORMANCE ANALYSIS OF' FILE ORGANIZATIONS THAT USE MULTI-BUCKET DATA LEAVES WITH PARTIAL EXPANSIONS
- CS0644
M.J. Fischer, S. Moran, S. Rudich, G. Taubenfe1d:
THE WAKEUP PROBLEM (Draft)
- CS0645
S. Katz, I. Forman, M. Evangelist:
LANGUAGE CONSTRUCTS FOR DISTRIBUTED SYSTEMS
- CS0646
E. Korach and A. Tal:
DIRECTED VERTEX DISJOINT PATHS PROBLEM IN MIXED SERIES-PARALLEL GRAPHS
- CS0647
Limor Fix and Nissim Francez:
PROOF RULES FOR DYNAMIC PROCESS CREATION AND DESTRUCTION
- CS0648
E. Korach and Nir Solel:
A NOTE ON TREE-WIDTH, PATH-WIDTH AND CUTWIDTH
- CS0649
I. Efrat and M. Israeli:
A HYBRID SO~UTION OF THE SEMICONDUCTOR DEVICE EQUATIONS
- CS0650
Amir Herzberg:
EARLY TERMINATIPN IN UNRELIABLE COMMUNICATION NETWORKS
- CS0651
Gabriel Matsliach:
USING MULTI-BUCKET DATA LEAVES WITH OVERFLOW CHAINS - PERFORMANCE ANALYS IS
- CS0652
E. Dahlhaus and J .A. Makowsky:
QUERY LANGUAGES FOR HIERARCHIC DATABASES
- CS0653
Eyal Kushilevitzı:
FOUNDATIONS OF CRYPTOGRAPHY
- CS0654
0, Galdreich and L. Shrira:
ON THE COMPLEXITY OF COMPUTATION IN THE PRESENCE OF LINK FAILURES: THE CASE OF A RING
- CS0655
E. antorowitz and Y. Schechner:
MANAGING THE SHAPE OF PLANAR SPLINES BY THEIR CONTROL 'POLYGONS
- CS0656
H. Shachnai and M. Hofri:
PARTIAL INFORMATION AND ITS LIMITED UTILITY - THE CASE OF REORGANIZING LISTS
- CS0657
R. Bar-Yehuda and R. Grinwald:
AN 0{N-Hl1+£)-TIME ALGORITM TO MERGE H SIMPLE POLYGONS
- CS0658
Mody Lempel and Azaria Paz:
AN ALGORITHM FOR FINDING A SHORTEST VECTOR IN A TWO DIMENSIONAL MODULAR LATTICE
- CS0659
S. Even and S. Raj sbawn:
THE USE OF A SYNCHRONIZER YIELDS MAXIMUM COMPUTATION RATE IN DISTRIBUTED NETWORKS
- CS0660
Ilan Bar-On and Avram Sidi:
NEW ALGORITHM,S FOR POLYNOMIAL AND TRIGONOMETRIC INTERPOLATION ON PARALLEL COMPUTERS
- CS0661
Ilan Bar-On:
EFFICIENT LOGARITHMIC TIME PARALLEL ALGORITHMS FOR THE CHOLESKY DECO~OSITION OF BAND MATRICES
- CS0662
Gabi Bracha and Ophir Rachman:
APPROXIMATED COUNTERS AND RANDOMIZED CONSENSUS
- CS0663
A. Ginzburg and M. Yoeli:
SYNTHESIS OF DELAY-INSENSITIVE CIRCUITS SPECIFIED BY TRACE GRAPHS
- CS0664
Avram Sidi:
RATIONAL APPROXIMATIONS FROM POWER SERIES OF VECTOR-VALUED MEROMORPHIC FUNCTIONS WITH AN APPLICATION TO MATRIX EIGENVALUE PROBLEMS
- CS0665
Llan Bar-On:
NEW DIVIDE AND CONQUER PARALLEL ALGORITHMS FOR THE CHOLESKY DECOMPOSITION AND GRAM-:SCHMIDT PROCESS
- CS0666
Ofer Biran, Sh1omo Moran and Shmuel Zaks:
DECIDING I-SOLVABILITY OF DISTRIBUTED TASKS IS NP-HARD
- CS0667
I1an Bar-On:
A NEW DIVIDE AND CONQUER PARALLEL ALGORITHM FOR THE CHOLESKY PECOMPOSITION OF BAND MATRICES
To the main CS technical reports page