1995 CS Technical Reports
- CS0834
Unknown: see paper:
Unknown: see paper
- CS0841
Unknown: see paper:
Unknown: see paper
- CS0843
J.A. Makowsky and U. Rotics:
THE t-SPANNER PROBLEM IS NP-COMPLETE ON CHORDAL
GRAPHS.
- CS0844
J.A. Makowsky and E.V. Ravve:
INCREMENTAL MODEL CHECKING FOR SAFETY PROPERTIES ON
DECOMPOSABLE STRUCTURES.
- CS0845
O. Gerstel, I. Cidon and S. Zaks:
OPTIMAL VIRTUAL PATH LAYOUT IN ATM NETWORKS WITH
SHARED ROUTING TABLE SWITCHES.
- CS0846-not-published(*)
Not published:
Not published
- CS0847(*)
S. Ben-David, N. Eiron and E. Kushilevitz:
ON SELF-DIRECTED LEARNING.
- CS0848
J.A. Makowsky and E.V. Ravve:
INCREMENTAL MODEL CHECKING FOR DECOMPOSABLE
STRUCTURES.
- CS0849
J.A. Makowsky and Y.B. Pnueli:
LOGICS CAPTURING RELATIVIZED COMPLEXITY CLASSES
UNIFORMLY.
- CS0850(*)
R.M. Roth and G. Seroussi:
LOCATION-CORRECTING CODES.
- CS0851
Y. Shapira:
NOTE ON ``IS SOR COLOR-BLIND?'':
- CS0852
O. Gerstel, A. Wool and S. Zaks:
OPTIMAL LAYOUTS ON A CHAIN ATM NETWORK.
- CS0853
S. Even, A. Litman and P. Winkler:
COMPUTING WITH SNAKES IN DIRECTED NETWORKS
OF AUTOMATA.
- CS0854
S. Even, A. Litman and A. Rosenberg:
MONOCHROMATIC PATHS AND TRIANGULATED
GRAPHS.
- CS0855
M. Frances and A. Litman:
OPTIMAL MISTAKE BOUND LEARNING IS HARD.
- CS0856(*)
H. Attiya, H. Shachnai and T. Tamir:
LOCAL LABELING AND RESOURCE ALLOCATION
USING PREPROCESSING.
- CS0857-not-published(*)
Not published:
Not published
- CS0858(*)
I. Bar-On, B. Codenotti and M. Leoncini:
CHECKING ROBUST NON-SINGULARITY OF A
GENERAL TRIDIAGONAL MATRIX IN LINEAR TIME.
- CS0859(*)
E. Kushilevitz and Y. Mansour:
RANDOMNESS IN PRIVATE COMPUTATIONS.
- CS0860(*)
Ron M. Roth:
TENSOR CODES FOR THE RANK METRIC.
- CS0861
M. Bellare and E. Petrank:
MAKING ZERO-KNOWLEDGE PROVERS
EFFICIENT.
- CS0862
O. Goldreich, R. Ostrovsky and E. Petrank:
COMPUTATIONAL
COMPLEXITY AND KNOWLEDGE COMPLEXITY.
- CS0863(*)
I. Bar-On and M. Leoncini:
RELIABLE SEQUENTIAL ALGORITHMS
FOR SOLVING BIDIAGONAL SYSTEMS OF LINEAR EQUATIONS.
- CS0864
Yair Shapira:
PARALLELIZABLE APPROXIMATE SOLVERS FOR
RECURSIONS ARISING IN PRECONDITIONING.
- CS0865
E. Efrat and A. Itai:
IMPROVEMENTS ON BOTTLENECK MATCHING
USING GEOMETRY.
- CS0866(*)
J.J. Ashley, B.H. Marcus and R.M. Roth:
ON THE DECODING
DELAY OF ENCODERS FOR INPUT-CONSTRAINED CHANNELS.
- CS0867
Eliezer Kantorowitz:
ALGORITHM SIMPLIFICATION THROUGH
OBJECT ORIENTATION.
- CS0868(*)
J-J. Climent, M. Neumann and A. Sidi:
A SEMI--ITERATIVE
METHOD FOR SINGULAR LINEAR SYSTEMS WITH ARBITRARY INDEX.
- CS0869(*)
E. Kushilevitz, R. Ostrovsky and A. Rosen:
CHARACTERIZING
LINEAR SIZE CIRCUITS IN TERMS OF PRIVACY.
- CS0870(*)
E. Kushilevitz, N. Linial and R. Ostrovsky:
THE
LINEAR-ARRAY CONJECTURE OF COMMUNICATION COMPLEXITY IS FALSE.
- CS0871(*)
Ye. Dinitz and J. Westbrook:
MAINTAINING THE CLASSES OF
4-EDGE-CONNECTIVITY IN A GRAPH ON-LINE.
- CS0872(*)
A. Sidi:
APPLICATION OF SOME NEW VARIABLE TRANSFORMATIONS
TO MULTIDIMENSIONAL INTEGRATION BY LATTICE RULES.
- CS0873(*)
Ye. Dinitz:
A COMPACT LAYOUT OF BUTTERFLY ON THE SQUARE
GRID.
- CS0874(*)
A. Sidi:
A COMPLETE CONVERGENCE AND STABILITY THEORY FOR A
GENERALIZED RICHARDSON EXTRAPOLATION PROCESS.
- CS0875
R. Anderson and E. Biham:
TWO PRACTICAL AND PROVABLE SECURE BLOCK CIPHERS: BEAR AND LION.
(*) An electronic copy does not exist in this server
To the main CS technical reports page