Google
Google Scholar
MS Academic Search
CiteSeerX
Semantic Scholar17. ICALP 1990: Warwick University, England
Mike Paterson:
Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, July 16-20, 1990, Proceedings. Lecture Notes in Computer Science 443, Springer 1990, ISBN 3-540-52826-1
Session 1
- Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time. 6-19
Session 2
- Jon G. Riecke:
A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report). 20-31
Session 3
Session 4
- Viliam Geffert:
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. 111-124 - Juraj Wiedermann:
Normalizing and Accelerating RAM Computations and the Problem of Reasonable Space Measures. 125-138
Session 5
- Radha Jagadeesan, Prakash Panangaden:
A Domain-Theoretic Model for a Higher-Order Process Calculus. 181-194
Session 6
- Matthew Hennessy, Anna Ingólfsdóttir:
A Theory of Communicating Processes with Value-Passing. 209-219 - Philippe Flajolet, Paolo Sipala, Jean-Marc Steyaert:
Analytic Variations on the Common Subexpression Problem. 220-234 - Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn:
Can A Maximum Flow be Computed on o(nm) Time? 235-248
Session 7
- Evangelos Kranakis, Danny Krizanc, Jacob van den Berg:
Computing Boolean Functions on Anonymous Networks. 254-267 - Ronald V. Book, Jack H. Lutz, Shouwen Tang:
Additional Queries to Random and Pseudorandom Oracles. 283-293
Session 8
- Alexander Moshe Rabinovich, Boris A. Trakhtenbrot:
Communication among Relations (Extended Abstract). 294-307 - Prakash Panangaden, Vasant Shanbhogue, Eugene W. Stark:
Stability and Sequentiality in Dataflow Networks. 308-321 - Costas Courcoubetis, Mihalis Yannakakis:
Markov Decision Processes and Regular Events (Extended Abstract). 336-349
Session 9
- Rakesh M. Verma, I. V. Ramakrishnan:
Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems. 370-385
Session 10
- David P. Dobkin, David G. Kirkpatrick:
Determining the Separation of Preprocessed Polyhedra - A Unified Approach. 400-413 - Leonidas J. Guibas, Donald E. Knuth, Micha Sharir:
Randomized Incremental Construction of Delaunay and Voronoi Diagrams. 414-431 - Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing:
Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). 432-445
Session 11
- Mark Jerrum, Alistair Sinclair:
Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract). 462-475
Session 12
- Christian Choffrut:
Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case. 490-500
Session 13
- Kim Guldstrand Larsen, Liu Xinxin:
Compositionality Through an Operational Semantics of Contexts. 526-539
Session 14
- Victor Y. Pan, John H. Reif:
On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid. 612-625 - Jan Friso Groote, Frits W. Vaandrager:
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence. 626-638
Session 15
- J. V. Tucker, S. S. Wainer, Jeffery I. Zucker:
Provable Computable Functions on Abstract Data Types. 660-673
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
Session 17
- Sanjiva Prasad, Alessandro Giacalone, Prateek Mishra:
Operational and Algebraic Semantics for Facile: A Symmetric Integration of Concurrent and Functional Programming. 765-778
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2016-09-23 21:14 CEST by the dblp team