Conference proceedings
© 1984

STACS 84

Symposium of Theoretical Aspects of Computer Science Paris, April 11-13, 1984

Editors:

M. Fontet,
K. Mehlhorn

M. Fontet

View editor publications

You can also search for this editor in PubMed Google Scholar
K. Mehlhorn

View editor publications

You can also search for this editor in PubMed Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 166)

3649 Accesses
131 Citations
3 Altmetric

Sections

Table of contents
Keywords
Bibliographic Information
Publish with us

Buy it now

Softcover Book USD 49.99

Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Learn about institutional subscriptions

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (30 papers)

Front Matter

PDF
Key-problems and key-methods in computational geometry
- Herbert Edelsbrunner
Pages 1-13
Some recent results on squarefree words
- Jean Berstel
Pages 14-25
Transformations realizing fairness assumptions for parallel programs
- K. R. Apt, E. -R. Olderog
Pages 26-42
Computing the largest empty rectangle
- B. Chazelle, R. L. Drysdale III, D. T. Lee
Pages 43-54
Approximation schemes for covering and packing problems in robotics and vlsi
- Dorit S. Hochbaum, Wolfgang Maass
Pages 55-62
Covering polygons with minimum number of rectangles
- Andrzej Lingas
Pages 63-72
On expressive interpretations of a Hoare-logic for Clarke's language L4
- Bernhard Josko
Pages 73-84
Towards executable specifications using conditional axioms
- K. Drosten
Pages 85-96
Proprietes Church-Rosser de systemes de reecriture equationnels ayant la propriete de terminaison faible
- H. Perdrix
Pages 97-108
On a general weight of trees
- R. Kemp
Pages 109-120
From expanders to better superconcentrators without cascading
- Eli Shamir
Pages 121-128
Locally synchronous complexity in the light of the trans-box method
- Edward G. Belaga
Pages 129-139
A new definition of morphism on Petri nets
- Glynn Winskel
Pages 140-150
Blocage et vivacité dans les réseaux a pile-file
- A. Finkel
Pages 151-162
Denotational semantics of concurrent programs with shared memory
- Manfred Broy
Pages 163-173
Higher order data structures
- Axel Poigné
Pages 174-185
Computability in higher types and the universal domain Pω
- G. Longo, S. Martini
Pages 186-197
On the structure of polynomial time degrees
- Klaus Ambos-Spies
Pages 198-208
Optimal layouts of the tree of meshes with vertices on the perimeter of the bounding convex region
- O. Sýkora, I. Vrto
Pages 209-217

Keywords

Bibliographic Information

Book Title: STACS 84
Book Subtitle: Symposium of Theoretical Aspects of Computer Science Paris, April 11-13, 1984
Editors: M. Fontet, K. Mehlhorn
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-12920-0
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1984
Softcover ISBN: 978-3-540-12920-2Published: 01 April 1984
eBook ISBN: 978-3-540-38805-0Published: 30 June 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: VIII, 339
Topics: Algorithm Analysis and Problem Complexity, Mathematical Logic and Formal Languages, Logics and Meanings of Programs

Publish with us

Policies and ethics

Access via your institution

Buy it now

Softcover Book USD 49.99

Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Learn about institutional subscriptions