- Email: [email protected]
Contents EATCS bulletin
Theoretical Computer North-Holland
349
Science 38 (1985) 349-351
CONTENTS
EATCS
BULLETIN
No. 26, June 1985
1.
2.
3.
4.
5.
EATCS Matters Letter from the Bulletin Editor
1
. . . . . . . . . . . . . . . . . . . . . . . . . .
ICALP ‘85 C.H. Papadimitriou: Basic information about ICALP in Nafplion-History ................................. Gastronomy ................. C.H. Papadimitriou: Computer Science in Greece ............................... Scientific program .............................. General information ............................... Travel information .......................... Pre and post conference tours
and Geography, 3 5 6 10 11 12
Technical Contributions L. Guibas and J. Hershberger: Computing the visibility graphs of n line segments in 0(n2) time . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . C.H. Papadimitriou: A note on the expressive power of Prolog . . . . . . . . . . . . A.K. Tsakalidis: The nearest common ancestor in a dynamic tree . . . . . . . . . . . M. Broy and A. Tarlecki: Algebraic specification of the abstract data type ‘Continuum’ J. Engelfriet: The non-computability of computability . . . . . . . . . . . . . . . . W. Emi and R. Geibel: Recognition of EOL by polynomial Boolean circuits . . . . . . H. Gaifman and M.Y. Vardi: A simple proof that connectivity of finite graphs is not first-order definable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . M. Gheorge: Descriptional complexity measures suggested by Hartmann’s error recovery scheme . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . K.-J. Lange: Addendum to “A note on the closure of EOL-languages under erasing homomorphisms” . . . . . . . . . . . . . . . . . , . . . . . . . . . . . . J.-J. Pansiot: Subword complexities and iteration . . . . . . . . . . . . . . . . . . K.G. Subramanian: Regular control on NLC grammars . . . . . . . . . . . _ . . . M.Y. Vardi: A response to “A complete axiomatisation for full join dependencies in relations” J. Vyskoc: Pigeon-hole principle and Boolean matrix multiplication . . . . . . . . . . Surveys and Tutorials A.L. Rosenberg: Challenges and opportunities in VLSI theory . . . . . . . . . . . . A. Salomaa: Cryptography from Caesar to DES and RSA . . . . . . . . . . . . . . Reports on Conferences Meetings of the Technical Group on Automata and Languages, IECE, Japan, SeptemberOctober 1984 (abstracts submitted by M. Kimura) . . . . . . . . . . . . . . . FOCS 1984, W. Palm Beach, Florida, U.S.A., October 1984 (report by J. van Leeuwen) 3rd Workshop on Theory and Applications of Abstract Data Types, Bremen, West Germany, November 1984 (report by P. Padawitz, abstracts included) . . . . . . . . . . . 2nd Oberwolfach Meeting on Efficient Algorithms, Oberwolfach, West Germany, November 1984 (report by A. Tsakalidis, abstracts included) . . . . . . . . . . . . . . . . BCS-FACS Meeting on “Computer Science -some current mathematical approaches”, London, Great Britain, December 1984 (report by M. Clint, abstracts included) . .
0304-3975/85/$3.30
@ 1985, Elsevier Science Publishers
B.V. (North-Holland)
13 21 23 32 36 40 43 45 55 55
63 65 67
69 101
_
120 127
.
129
.
154
.
170
Contents EATCS Bulletin
350 TAPSOFT,
West Berlin, West Germany, March 1985 (report by E.G. Wagner) . . . . . Foundations of Programming Semantics, Manhattan, Kansas, U.S.A., April 1985 (report by D. Benson) . . . . . . . . . . . . . . . . . . . . . . . . STOC 1985, Providence, Rhode Island, U.S.A., May 1985 (report by K. Winklmann) . . .
180
The Mathematical
6.
Conference Announcements ISCAS ‘85, Kyoto, Japan (June 5-7, 1985) . . . . . . . . . . . . . . . . . . . . . International Workshop on Distributed Algorithms on Graphs, Ottawa, Canada (August l-2,1985) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ACM Symposium on Principles of Distributed Computing, Minacki, Ontario, Canada . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (August 5-7, 1985) International Summer School on Advanced Programming Methodologies, San Sebastian, Spain (September 2-6, 1985) . . . . . . . . . . . . . . . . . . . . . . . . . . Summer Workshop*on Category Theory and Computer Programming, Guildford, Great . . . . . . . . . . . . . . . . . . . . . . . Britain (September 16-19, 1985) 13th POPL, St. Petersburg, Florida, U.S.A. (January 13-15, 1986) . . . . . . . . . . . STACS 86, Orsay, France (January 16-18, 1986) . . . . . . . . . . . . . . . . . . European Symposium on Programming, Saarbriicken, West Germany (March 17-19, 1986) Conference on Theoretical Aspects of Reasoning about Knowledge, Monterey, California, . . . . . . . . . . . . . . . . . . . . . . . . . . U.S.A. (March 19-22, 1986) 2nd Symposium on Computer Geometry, Yorktown Heights, New York, U.S.A. (June 2-4, 1986) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Structure in Complexity Theory, Berkeley, California, U.S.A. (June 2-5, 1986) . . . . . Advanced Course on Petri Nets, Bad Honnef, West Germany (September 8-19, 1986) . . ICALP ‘86, Rennes, France (July 15- 19, 1986) . . . . . . . . . . , . . . . . . . .
187 189
194 195 196 198 200 201 202 203 204 205 206 207 208
7.
Calendar of Events
.
209
8.
Reports on Computer Science Departments and Institutes Faculty of Mathematics and Computer Science, University of Passau, West Germany. . . Theoretical Computer Science at the University of Waterloo, Ontario, Canada . . . .
211 214
Technical Reports and Publications Computer Science Department, University of Bordeaux, France . . _ . . . . . _ . . Department of Computer Science, Cornell University, Ithaca, New York, U.S.A. . . . . Center for Research in Computing Technology, Harvard University, Cambridge, MA, U.S.A. Faculty of Mathematics and Computer Science, University of Passau, West Germany. . Computer Science Department, University of Utrecht, The Netherlands . . . . . . . . The Weizmann Institute of Science, Rehovot, Israel . . . . . . . . . . . . . . . .
215 218 219 221 224 226
9.
10.
11.
12.
. . . . . : . . . . . . . . . . . . . . . . . . . . . . .
Book Reviews Z. Bavel: Introduction to the theory of automata, Reston Publishing Company, 1983 (reviewed by A. Salomaa) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . , . H.K. Berg, W.E. Boebert, W.R. Franta and T.G. Moher: Formal methods of program verification and specification, Prentice-Hall, Englewood Cliffs, NJ, 1982 (reviewed by J.W. Klop) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . * . H. Maurer, (ed.): Uberblicke Informationsverarbeitung, Bibliographisches Institut, 1984 (reviewed by A. Salomaa) . . . . . . . . . . . . . . . . . . . _ . . . . . _ Problems and Solutions Problems contributed by H. Edelsbrunner, J. Kleijn, G. Rozenberg and S. Wolfram Solutions contributed by J.E. Goodman, R. Pollack, E. Allender and M. Clerbout Abstracts of Ph.D. Theses H.R. Nielson: Hoare logic for run-time analysis of programs
233
235 237
. . . . . .
238 242
. . . . . . _ . . . . . .
246
351
Contents EATCS Bulletin
13.
Miscellaneous . . . . . . . . . . . . . . . . . . . . . . . . . . _ _ . A letter from A. Blikle Petri Net Newsletter . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
250 251
_ . .
251
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . T . . .
255
14.
The Contents of “Theoretical Computer Science”
15.
EATCSleajlet
. . . . _ . . . . . . . . .
BuZZetin Editor: G. Rozenberg, Leiden, The Netherlands Production and distribution: Th. Ottmann, Karlsruhe, Fed. Rep. Germany Picture Editor: P. van Emde Boas, Amsterdam, The Netherlands
349
Science 38 (1985) 349-351
CONTENTS
EATCS
BULLETIN
No. 26, June 1985
1.
2.
3.
4.
5.
EATCS Matters Letter from the Bulletin Editor
1
. . . . . . . . . . . . . . . . . . . . . . . . . .
ICALP ‘85 C.H. Papadimitriou: Basic information about ICALP in Nafplion-History ................................. Gastronomy ................. C.H. Papadimitriou: Computer Science in Greece ............................... Scientific program .............................. General information ............................... Travel information .......................... Pre and post conference tours
and Geography, 3 5 6 10 11 12
Technical Contributions L. Guibas and J. Hershberger: Computing the visibility graphs of n line segments in 0(n2) time . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . C.H. Papadimitriou: A note on the expressive power of Prolog . . . . . . . . . . . . A.K. Tsakalidis: The nearest common ancestor in a dynamic tree . . . . . . . . . . . M. Broy and A. Tarlecki: Algebraic specification of the abstract data type ‘Continuum’ J. Engelfriet: The non-computability of computability . . . . . . . . . . . . . . . . W. Emi and R. Geibel: Recognition of EOL by polynomial Boolean circuits . . . . . . H. Gaifman and M.Y. Vardi: A simple proof that connectivity of finite graphs is not first-order definable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . M. Gheorge: Descriptional complexity measures suggested by Hartmann’s error recovery scheme . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . K.-J. Lange: Addendum to “A note on the closure of EOL-languages under erasing homomorphisms” . . . . . . . . . . . . . . . . . , . . . . . . . . . . . . J.-J. Pansiot: Subword complexities and iteration . . . . . . . . . . . . . . . . . . K.G. Subramanian: Regular control on NLC grammars . . . . . . . . . . . _ . . . M.Y. Vardi: A response to “A complete axiomatisation for full join dependencies in relations” J. Vyskoc: Pigeon-hole principle and Boolean matrix multiplication . . . . . . . . . . Surveys and Tutorials A.L. Rosenberg: Challenges and opportunities in VLSI theory . . . . . . . . . . . . A. Salomaa: Cryptography from Caesar to DES and RSA . . . . . . . . . . . . . . Reports on Conferences Meetings of the Technical Group on Automata and Languages, IECE, Japan, SeptemberOctober 1984 (abstracts submitted by M. Kimura) . . . . . . . . . . . . . . . FOCS 1984, W. Palm Beach, Florida, U.S.A., October 1984 (report by J. van Leeuwen) 3rd Workshop on Theory and Applications of Abstract Data Types, Bremen, West Germany, November 1984 (report by P. Padawitz, abstracts included) . . . . . . . . . . . 2nd Oberwolfach Meeting on Efficient Algorithms, Oberwolfach, West Germany, November 1984 (report by A. Tsakalidis, abstracts included) . . . . . . . . . . . . . . . . BCS-FACS Meeting on “Computer Science -some current mathematical approaches”, London, Great Britain, December 1984 (report by M. Clint, abstracts included) . .
0304-3975/85/$3.30
@ 1985, Elsevier Science Publishers
B.V. (North-Holland)
13 21 23 32 36 40 43 45 55 55
63 65 67
69 101
_
120 127
.
129
.
154
.
170
Contents EATCS Bulletin
350 TAPSOFT,
West Berlin, West Germany, March 1985 (report by E.G. Wagner) . . . . . Foundations of Programming Semantics, Manhattan, Kansas, U.S.A., April 1985 (report by D. Benson) . . . . . . . . . . . . . . . . . . . . . . . . STOC 1985, Providence, Rhode Island, U.S.A., May 1985 (report by K. Winklmann) . . .
180
The Mathematical
6.
Conference Announcements ISCAS ‘85, Kyoto, Japan (June 5-7, 1985) . . . . . . . . . . . . . . . . . . . . . International Workshop on Distributed Algorithms on Graphs, Ottawa, Canada (August l-2,1985) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ACM Symposium on Principles of Distributed Computing, Minacki, Ontario, Canada . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (August 5-7, 1985) International Summer School on Advanced Programming Methodologies, San Sebastian, Spain (September 2-6, 1985) . . . . . . . . . . . . . . . . . . . . . . . . . . Summer Workshop*on Category Theory and Computer Programming, Guildford, Great . . . . . . . . . . . . . . . . . . . . . . . Britain (September 16-19, 1985) 13th POPL, St. Petersburg, Florida, U.S.A. (January 13-15, 1986) . . . . . . . . . . . STACS 86, Orsay, France (January 16-18, 1986) . . . . . . . . . . . . . . . . . . European Symposium on Programming, Saarbriicken, West Germany (March 17-19, 1986) Conference on Theoretical Aspects of Reasoning about Knowledge, Monterey, California, . . . . . . . . . . . . . . . . . . . . . . . . . . U.S.A. (March 19-22, 1986) 2nd Symposium on Computer Geometry, Yorktown Heights, New York, U.S.A. (June 2-4, 1986) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Structure in Complexity Theory, Berkeley, California, U.S.A. (June 2-5, 1986) . . . . . Advanced Course on Petri Nets, Bad Honnef, West Germany (September 8-19, 1986) . . ICALP ‘86, Rennes, France (July 15- 19, 1986) . . . . . . . . . . , . . . . . . . .
187 189
194 195 196 198 200 201 202 203 204 205 206 207 208
7.
Calendar of Events
.
209
8.
Reports on Computer Science Departments and Institutes Faculty of Mathematics and Computer Science, University of Passau, West Germany. . . Theoretical Computer Science at the University of Waterloo, Ontario, Canada . . . .
211 214
Technical Reports and Publications Computer Science Department, University of Bordeaux, France . . _ . . . . . _ . . Department of Computer Science, Cornell University, Ithaca, New York, U.S.A. . . . . Center for Research in Computing Technology, Harvard University, Cambridge, MA, U.S.A. Faculty of Mathematics and Computer Science, University of Passau, West Germany. . Computer Science Department, University of Utrecht, The Netherlands . . . . . . . . The Weizmann Institute of Science, Rehovot, Israel . . . . . . . . . . . . . . . .
215 218 219 221 224 226
9.
10.
11.
12.
. . . . . : . . . . . . . . . . . . . . . . . . . . . . .
Book Reviews Z. Bavel: Introduction to the theory of automata, Reston Publishing Company, 1983 (reviewed by A. Salomaa) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . , . H.K. Berg, W.E. Boebert, W.R. Franta and T.G. Moher: Formal methods of program verification and specification, Prentice-Hall, Englewood Cliffs, NJ, 1982 (reviewed by J.W. Klop) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . * . H. Maurer, (ed.): Uberblicke Informationsverarbeitung, Bibliographisches Institut, 1984 (reviewed by A. Salomaa) . . . . . . . . . . . . . . . . . . . _ . . . . . _ Problems and Solutions Problems contributed by H. Edelsbrunner, J. Kleijn, G. Rozenberg and S. Wolfram Solutions contributed by J.E. Goodman, R. Pollack, E. Allender and M. Clerbout Abstracts of Ph.D. Theses H.R. Nielson: Hoare logic for run-time analysis of programs
233
235 237
. . . . . .
238 242
. . . . . . _ . . . . . .
246
351
Contents EATCS Bulletin
13.
Miscellaneous . . . . . . . . . . . . . . . . . . . . . . . . . . _ _ . A letter from A. Blikle Petri Net Newsletter . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
250 251
_ . .
251
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . T . . .
255
14.
The Contents of “Theoretical Computer Science”
15.
EATCSleajlet
. . . . _ . . . . . . . . .
BuZZetin Editor: G. Rozenberg, Leiden, The Netherlands Production and distribution: Th. Ottmann, Karlsruhe, Fed. Rep. Germany Picture Editor: P. van Emde Boas, Amsterdam, The Netherlands