The SCEAS System
Navigation Menu

Conferences in DBLP

International Colloquium on Automata, Languages and Programming (ICALP) (icalp)
1988 (conf/icalp/1988)

  1. Alok Aggarwal, Ashok K. Chandra
    Communication Complexity of PRAMs (Preliminary Version). [Citation Graph (1, 0)][DBLP]
    ICALP, 1988, pp:1-17 [Conf]
  2. Luc Albert, François Fages
    Average Case Complexity Analysis of the Rete Multi-Pattern Match Algorithm. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:18-37 [Conf]
  3. Stefan Arnborg, Jens Lagergren, Detlef Seese
    Problems Easy for Tree-Decomposable Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:38-51 [Conf]
  4. Ralph-Johan Back, Reino Kurki-Suonio
    Serializability in Distributed Systems with Handshaking. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:52-66 [Conf]
  5. Chandrajit L. Bajaj, Myung-Soo Kim
    Algorithms for Planar Geometric Models. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:67-81 [Conf]
  6. Gyora M. Benedek, Alon Itai
    Nonuniform Learnability. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:82-92 [Conf]
  7. Jean Berstel, Christophe Reutenauer
    Zeta Functions of Recognizable Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:93-104 [Conf]
  8. Hans L. Bodlaender
    Dynamic Programming on Graphs with Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:105-118 [Conf]
  9. Jik H. Chang, Oscar H. Ibarra, Michael A. Palis
    Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM's and Space-Bounded TM's. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:119-132 [Conf]
  10. Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
    Optimal Slope Selection. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:133-146 [Conf]
  11. Robert Cori, Yves Métivier
    Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:147-161 [Conf]
  12. Karel Culik II
    New Techniques for Proving the Decidability of Equivalence Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:162-175 [Conf]
  13. Volker Diekert
    Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:176-187 [Conf]
  14. Martin Dietzfelbinger, Wolfgang Maass
    The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:188-200 [Conf]
  15. Herbert Edelsbrunner
    Geometric Structures in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:201-213 [Conf]
  16. Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
    Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:214-229 [Conf]
  17. David Eppstein
    Reset Sequences for Finite Automata with Application to Design of Parts Orienters. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:230-238 [Conf]
  18. Philippe Flajolet, Danièle Gardy, Loÿs Thimonier
    Random Allocations and Probabilistic Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:239-253 [Conf]
  19. Jozef Gruska
    Systolic Architectures, Systems and Computations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:254-270 [Conf]
  20. Juris Hartmanis
    New Developments in Structural Complexity Theory. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:271-286 [Conf]
  21. Claude Kirchner, Hélène Kirchner, José Meseguer
    Operational Semantics of OBJ-3 (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    ICALP, 1988, pp:287-301 [Conf]
  22. Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
    Do We Really Need to Balance Patricia Trees? (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:302-316 [Conf]
  23. Joost N. Kok, Jan J. M. M. Rutten
    Contractions in Comparing Concurrent Semantics. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:317-332 [Conf]
  24. Clyde P. Kruskal, Larry Rudolph, Marc Snir
    A Complexity Theory of Efficient Parallel Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:333-346 [Conf]
  25. Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi
    On the Learnability of DNF Formulae. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:347-361 [Conf]
  26. Clemens Lautemann
    Efficient Algorithms on Context-Free Graph Grammars. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:362-378 [Conf]
  27. Thomas Lengauer, Egon Wanke
    Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    ICALP, 1988, pp:379-393 [Conf]
  28. Andrzej Lingas, Maciej M. Syslo
    A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:394-409 [Conf]
  29. Kurt Mehlhorn, Chee-Keng Yap
    Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:410-423 [Conf]
  30. Valtteri Niemi
    Maximal Dense Intervals of Grammar Forms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:424-438 [Conf]
  31. Prakash Panangaden, Eugene W. Stark
    Computations, Residuals, and the POwer of Indeterminancy. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:439-454 [Conf]
  32. Sanguthevar Rajasekaran, John H. Reif
    Nested Annealing: A Provable Improvement to Simulated Annealing. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:455-472 [Conf]
  33. R. Ramesh, I. V. Ramakrishnan
    Nonlinear Pattern Matching in Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:473-488 [Conf]
  34. Ren-ji Tao
    Invertibility of Linear Finite Automata Over a Ring. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:489-501 [Conf]
  35. Hans Rohnert
    Moving Discs Between Polygons. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:502-515 [Conf]
  36. Steven Rudich, Leonard Berman
    Optimal Circuits and Transitive Automorphism Groups. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:516-524 [Conf]
  37. Jürgen Schäfer
    A Kleene-Presburgerian Approach to Linear Production Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:525-534 [Conf]
  38. Klaus Simon
    On Minimum Flow and Transitive Reduction. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:535-546 [Conf]
  39. Jean-Claude Spehner
    La Reconnaissance des Facteurs d'un Language Fini dans un Texte en Temps Lineaire (Resume). [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:547-560 [Conf]
  40. Howard Straubing, Denis Thérien, Wolfgang Thomas
    regular Languages Defined with Generalized Quantifiers. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:561-575 [Conf]
  41. Roberto Tamassia
    A Dynamic Data Structure for Planar Graph Embedding (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:576-590 [Conf]
  42. Shouwen Tang, Ronald V. Book
    Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:591-599 [Conf]
  43. Gerard Tel
    Assertional Verification of a Timer Based Protocol. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:600-614 [Conf]
  44. Satish Thatte
    Type Inference with Partial Types. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:615-629 [Conf]
  45. P. S. Thiagarajan
    Some Behavioural Aspects of Net Theory. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:630-653 [Conf]
  46. Paavo Turakainen
    The Equivalence of DGSM Replications on Q-Rational Languages is Decidable. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:654-666 [Conf]
  47. Vijay V. Vazirani, Mihalis Yannakakis
    Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:667-681 [Conf]
  48. Klaus W. Wagner
    On Restricting the Access to an NP-Oracle. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:682-696 [Conf]
  49. Osamu Watanabe
    On <=^P_{1-tt}-Sparseness and Nondeterministic Complexity Classes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:697-709 [Conf]
  50. W. P. Weijland
    Semantics for Logic Programs without Occur Check. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:710-726 [Conf]
  51. Jia-Huai You
    Outer Narrowing for Equational Theories Based on Constructors. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:727-741 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002