17. ICALP 1990: Warwick University, England

@proceedings{DBLP:conf/icalp/1990,
  editor    = {Mike Paterson},
  title     = {Automata, Languages and Programming, 17th International Colloquium,
               ICALP90, Warwick University, England, July 16-20, 1990, Proceedings},
  booktitle = {ICALP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {443},
  year      = {1990},
  isbn      = {3-540-52826-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Session 1

• Stefan Näher, Kurt Mehlhorn: LEDA: A Library of Efficient Data Types and Algorithms. 1-5 BibTeX
• Martin Dietzfelbinger, Friedhelm Meyer auf der Heide: A New Universal Class of Hash Functions and Dynamic Hashing in Real Time. 6-19 BibTeX

Session 2

• Jon G. Riecke: A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report). 20-31 BibTeX
• Michael I. Schwartzbach: Static Correctness of Hierarchical Procedures. 32-45 BibTeX
• Sophie Malecki: Generic Terms Having No Polymorphic Types. 46-59 BibTeX

Session 3

• Daniel Krob: A Complete System of B-Rational Identities. 60-73 BibTeX
• Aldo de Luca, Stefano Varricchio: On Non-Counting Regular Classes. 74-87 BibTeX
• Marcella Anselmo: Two-Way Automata with Multiplicity. 88-102 BibTeX
• Werner Kuich: Omega-Continuous Semirings, Algebraich Systems and Pushdown Automata. 103-110 BibTeX

Session 4

• Viliam Geffert: Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. 111-124 BibTeX , journal version: SIAM J. Comput. 20(3): 484-498(1991) BibTeX
• Juraj Wiedermann: Normalizing and Accelerating RAM Computations and the Problem of Reasonable Space Measures. 125-138 BibTeX
• Osamu Watanabe: A Formal Study of Learning via Queries. 139-152 BibTeX
• Sanjay Jain, Arun Sharma: Language Learning by a "Team" (Extended Abstract). 153-166 BibTeX

Session 5

• Robin Milner: Functions as Processes. 167-180 BibTeX
• Radha Jagadeesan, Prakash Panangaden: A Domain-Theoretic Model for a Higher-Order Process Calculus. 181-194 BibTeX
• Manfred Droste: Concurrency, Automata and Domains. 195-208 BibTeX

Session 6

• Matthew Hennessy, Anna Ingólfsdóttir: A Theory of Communicating Processes with Value-Passing. 209-219 BibTeX
• Philippe Flajolet, Paolo Sipala, Jean-Marc Steyaert: Analytic Variations on the Common Subexpression Problem. 220-234 BibTeX
• Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn: Can A Maximum Flow be Computed on o(nm) Time? 235-248 BibTeX

Session 7

• Alexander A. Razborov: On the Distributional Complexity of Disjontness. 249-253 BibTeX
• Evangelos Kranakis, Danny Krizanc, Jacob van den Berg: Computing Boolean Functions on Anonymous Networks. 254-267 BibTeX
• Oded Goldreich, Hugo Krawczyk: On the Composition of Zero-Knowledge Proof Systems. 268-282 BibTeX
• Ronald V. Book, Jack H. Lutz, Shouwen Tang: Additional Queries to Random and Pseudorandom Oracles. 283-293 BibTeX

Session 8

• Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Communication among Relations (Extended Abstract). 294-307 BibTeX
• Prakash Panangaden, Vasant Shanbhogue, Eugene W. Stark: Stability and Sequentiality in Dataflow Networks. 308-321 BibTeX
• Rajeev Alur, David L. Dill: Automata For Modeling Real-Time Systems. 322-335 BibTeX
• Costas Courcoubetis, Mihalis Yannakakis: Markov Decision Processes and Regular Events (Extended Abstract). 336-349 BibTeX

Session 9

• Jan Willem Klop: Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond. 350-369 BibTeX
• Rakesh M. Verma, I. V. Ramakrishnan: Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems. 370-385 BibTeX
• Catuscia Palamidessi: Algebraic Properties of Idempotent Substitutions. 386-399 BibTeX

Session 10

• David P. Dobkin, David G. Kirkpatrick: Determining the Separation of Preprocessed Polyhedra - A Unified Approach. 400-413 BibTeX
• Leonidas J. Guibas, Donald E. Knuth, Micha Sharir: Randomized Incremental Construction of Delaunay and Voronoi Diagrams. 414-431 BibTeX
• Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing: Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). 432-445 BibTeX

Session 11

• David S. Johnson: Local Optimization and the Traveling Salesman Problem. 446-461 BibTeX
• Mark Jerrum, Alistair Sinclair: Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract). 462-475 BibTeX
• John E. Savage, Markus G. Wloka: On Parallelizing Graph-Partitioning Heuristics. 476-489 BibTeX

Session 12

• Christian Choffrut: Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case. 490-500 BibTeX
• Mireille Clerbout, Michel Latteux, Yves Roos: Decomposition of Partial Commutations. 501-511 BibTeX
• Maryse Pelletier: Boolean Closure and Unambiguity of Rational Sets. 512-525 BibTeX

Session 13

• Kim Guldstrand Larsen, Liu Xinxin: Compositionality Through an Operational Semantics of Contexts. 526-539 BibTeX
• Joachim Parrow: Structural and Behavioural Equivalences of Networks. 540-552 BibTeX
• Doron Peled, Amir Pnueli: Proving Partial Order Liveness Properties. 553-571 BibTeX
• Frank S. de Boer: A Proof System for the Parallel Object-Oriented Language POOL. 572-585 BibTeX

Session 14

• Norbert Blum: A New Approach to Maximum Matching in General Graphs. 586-597 BibTeX
• Giuseppe Di Battista, Roberto Tamassia: On-Line Graph Algorithms with SPQR-Trees. 598-611 BibTeX
• Victor Y. Pan, John H. Reif: On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid. 612-625 BibTeX
• Jan Friso Groote, Frits W. Vaandrager: An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence. 626-638 BibTeX

Session 15

• Neil D. Jones: Partial Evaluation, Self-Application and Types. 639-659 BibTeX
• J. V. Tucker, S. S. Wainer, Jeffery I. Zucker: Provable Computable Functions on Abstract Data Types. 660-673 BibTeX
• Hubert Comon: Equational Formulas in Order-Sorted Algebras. 674-688 BibTeX

Session 16

• Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars: An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version). 689-702 BibTeX
• Helmut Alt, Johannes Blömer, Hubert Wagener: Approximation of Convex Polygons. 703-716 BibTeX
• Frank Hoffmann: On the Rectilinear Art Gallery Problem (Extended Abstract). 717-728 BibTeX

Session 17

• Yossi Matias, Uzi Vishkin: On Parallel Hashing and Integer Sorting (Extended Summary). 729-743 BibTeX
• Prabhakar Radge: The Parallel Simplicity of Compaction and Chaining. 744-751 BibTeX
• Faron Moller: The Importance of the Left Merge Operator in Process Algebras. 752-764 BibTeX
• Sanjiva Prasad, Alessandro Giacalone, Prateek Mishra: Operational and Algebraic Semantics for Facile: A Symmetric Integration of Concurrent and Functional Programming. 765-778 BibTeX