1. ISTCS 1992: Haifa, Israel

• Jingsen Chen:
  Merging and Splitting Priority Queues and Deques in Parallel. 1-11
  
• Nader H. Bshouty:
  Lower Bounds for the Complexity of Functions in a Realistic RAM Model. 12-23
  
• Claire Kenyon, Valerie King:
  On Boolean Decision Trees with Faulty Nodes. 24-31
  
• Martin Charles Golumbic, Ron Shamir:
  Interval Graphs, Interval Orders and the Consistency of Temporal Events. 32-42
  
• Andrei Voronkov:
  Higher Order Functions in First Order Theory. 43-54
  
• Walter Dosch:
  Reduction Relations in Strict Applicative Language. 55-66
  
• Guy Kortsarz, David Peleg:
  Approximation Algorithms for Minimum Time Broadcast. 67-78
  
• Yosi Ben-Asher, David Peleg, Assaf Schuster:
  The Complexity of Reconfiguring Network Models. 79-90
  
• Shmuel Gal, Yona Hollander, Alon Itai:
  Optimal Mapping in Direct Mapped Cache Environments. 91-102
  
• Edith Cohen, Nimrod Megiddo:
  New Algorithms for Generalized Network Flows. 103-114
  
• Victor S. Miller:
  Factoring Polynomials via Relation-Finding. 115-121
  
• Victor Y. Pan:
  New Resultant Inequalities and Complex Polynomial Factorization. 122-136
  
• Elliot L. Linzer:
  Can Symmetric Toeplitz Solvers be Strongly Stable? 137-146
  
• Ilan Sadeh, Amir Averbuch:
  Bounds on Parallel Computation of Multivariate Polynomials. 147-153
  
• Cynthia Dwork, Maurice Herlihy, Serge A. Plotkin, Orli Waarts:
  Time-Lapse Snapshots. 154-170
  
• Rainer Gawlick, Nancy A. Lynch, Nir Shavit:
  Concurrent Timestamping Made Simple. 171-183
  
• Jean-Michel Hélary, Michel Raynal:
  Distributed Evaluation: A Tool for Constructing Distributed Detection Programs. 184-194
  
• Evgeny V. Luk-Silberman:
  Foundations of Asymptotical Theory of Determinate Compact Testing. 195-206
  
• Irith Ben-Arroyo Hartman:
  Optimal K-Coloring and K-Nesting of Intervals. 207-220
  

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