List of accepted papers to the 1996 Israeli Symposium on Theory of
Computing and Systems:

On advanced in optical computational models and problems
       which they help to solve
     --- Y.B. Karasik

Type dependencies for logic programs using aci-unification
     --- M. Codish, V. Lagoon

Making the original scoreboard mechanism deadlock free
     --- S. Muller, W. Paul

On the hardness of approximating max k-cut and its dual
     --- V. Kann, S. Khanna, J. Lagergren, A. Panconesi

A new nc algorithm for perfect matching in bipartite cubic graphs
     --- R. Sharan, A. Wigderson 

To weight or not to weight: where is the question?
     --- P. Crescenzi, R. Silvestri, L. Trevisan

Reduction-free normalisation for a polymorphic system
     --- T. Altenkirch, M. Hofmann, T. Streicher

Feasibility and unfeasibility of off-line processing
     --- M. Cadoli, F. Donini, P. Liberatore, M. Schaerf

Generalized submodular cover problems and applications
     --- J. Bar-Ilan, G. Kortsarz, D. Peleg

On the parallel computation of boolean functions on unrelated
       inputs
     --- A. Andreev, A. Clementi, J. Rolim

On satisfiability
     --- R. Zippel

On the Borowsky-Gafni simulation algorithm
     --- N. Lynch, S. Rajsbaum

On learning conjunctions with malicious noise
     --- Y. Mansour, M. Parnas

On chromatic sums and distributed resource allocation
     --- A. Bar-Noy, H. Shachnai, T. Tamir

Approximating minimum subset feedback sets in undirected graphs
       with applications
     --- G. Even, J. Naor, B. Schieber, L. Zosin

Baked potatoes routing
     --- S. Dolev, E. Kranakis, D. Krizanc

On privacy and partition arguments
     --- B. Chor, Y. Ishai

Physical maps and interval sandwich problems: bounded degrees
       help
     --- H. Kaplan, R. Shamir

Updating nonmonotonic databases
     --- C. Witteveen, W. van der Hoek

Packet routing via min-cost circuit routing
     --- B. Awerbuch, Y. Azar, A. Fiat

On the decisional complexity of problems over the reals
     --- M. Naor, S. Ruah

Deterministic approximation of the cover time
     --- U. Feige, Y. rabinovich

On the indecomposibility of certain language classes
     --- S.W. Margolis, M.V. Sapir, P. Weil

Smell as a computational resource - a lesson we can learn
       from the ant
     --- I.A. Wagner, M. Lindenbaum, A.M. Bruckstein

Symmetry breaking in anonymous networks: characterizations

     --- P. Boldi, B. Codenotti, P. Gemmell, S. Shammah, J. Simon, 
         S.  Vigna