Book Volume 1443 1998

Automata, Languages and Programming

25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13–17, 1998 Proceedings

Editors:

ISBN: 978-3-540-64781-2 (Print) 978-3-540-68681-1 (Online)

Table of contents (78 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. No Access

    Chapter

    Pages 1-16

    Algorithmic verification of linear temporal logic specifications

  3. No Access

    Chapter

    Pages 17-28

    On existentially first-order definable languages and their relation to NP

  4. No Access

    Chapter

    Pages 29-40

    An algebraic approach to communication complexity

  5. No Access

    Chapter

    Pages 41-52

    Deciding global partial-order properties

  6. No Access

    Chapter

    Pages 53-66

    Simple linear-time algorithms for minimal fixed points

  7. No Access

    Chapter

    Pages 67-78

    Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method

  8. No Access

    Chapter

    Pages 79-90

    Simpler and faster dictionaries on the AC0 RAM

  9. No Access

    Chapter

    Pages 91-102

    Partial-congruence factorization of bisimilarity induced by open maps

  10. No Access

    Chapter

    Pages 103-115

    Reset nets between decidability and undecidability

  11. No Access

    Chapter

    Pages 116-117

    Geometric algorithms for robotic manipulation

  12. No Access

    Chapter

    Pages 118-129

    Compact encodings of planar graphs via canonical orderings and multiple parentheses

  13. No Access

    Chapter

    Pages 130-139

    Reducing simple polygons to triangles - A proof for an improved conjecture -

  14. No Access

    Chapter

    Pages 140-151

    Difficult configurations — on the complexity of LTrL

  15. No Access

    Chapter

    Pages 152-163

    On the expressiveness of real and integer arithmetic automata

  16. No Access

    Chapter

    Pages 164-175

    Distributed matroid basis completion via elimination upcast and distributed correction of minimum-weight spanning trees

  17. No Access

    Chapter

    Pages 176-187

    Independent sets with domination constraints

  18. No Access

    Chapter

    Pages 188-199

    Robust asynchronous protocols are finite-state

  19. No Access

    Chapter

    Pages 200-211

    Deciding bisimulation-like equivalences with finite-state processes

  20. No Access

    Chapter

    Pages 212-214

    Do probabilistic algorithms outperform deterministic ones?

  21. No Access

    Chapter

    Pages 215-222

    A degree-decreasing Lemma for (MOD q, MOD p) circuits

previous Page of 4