Bibliography for BEATCS

[Aaronson, 2003]

S. Aaronson. Is P Versus NP Formally Independent?. Bulletin of the European Association for Theoretical Computer Science, 81:109-136, October 2003. Columns: Computational Complexity.

[Abiteboul, 1996]

S. Abiteboul. In Memoriam: Paris C. Kanellakis. Bulletin of the European Association for Theoretical Computer Science, 58:364, February 1996.

[Aceto and Ingolfsdottir, 2007]

L. Aceto and A. Ingolfsdottir. Characteristic formulae: from automata to logic. Bulletin of the European Association for Theoretical Computer Science, 91:57, February 2007. Columns: Concurrency.

[Aceto et al., 1999]

L. Aceto, W. Fokkink, and C. Verhoef. Conservative Extension in Structural Operational Semantics. Bulletin of the European Association for Theoretical Computer Science, 69:110-132, October 1999. Columns: Concurrency.

[Aceto et al., 2008a]

L. Aceto, J. Baeten, W. Fokkin, A. Ingolfsdottir, and U. Nestmann. Applying concurrency research in industry - report on a strategic workshop. Bulletin of the European Association for Theoretical Computer Science, 94:113--, February 2008. Columns: Concurrency.

[Aceto et al., 2008b]

L. Aceto, S. Capobianco, and A. Ingólfsdóttir. On the existence of a finite base for complete trace equivalence over bpa with interrupt. Bulletin of the European Association for Theoretical Computer Science, 95:220--, June 2008. Technical Contributions.

[Aceto et al., 2009]

L. Aceto, A. Ingolfsdottir, M.R. Mousavi, and M.A. Reniers. Algebraic Properties for Free! Bulletin of the European Association for Theoretical Computer Science, 99:81--, October 2009. Columns: Concurrency.

[Aceto, 2003]

L. Aceto. Some of My favourite Results in Classic Process Algebra. Bulletin of the European Association for Theoretical Computer Science, 81:90-108, October 2003. Columns: Concurrency.

[Aggarwal, 1989]

Alok Aggarwal. Research Topics in Computational Geometry. Bulletin of the European Association for Theoretical Computer Science, 39:388-409, October 1989. Problems and Solutions.

[Ainhirn, 1980]

W. Ainhirn. A note on goodness of E0L forms. Bulletin of the European Association for Theoretical Computer Science, 10:32-38, January 1980. Technical Contributions.

[Akman and Franklin, 1986]

V. Akman and W.R. Franklin. On the question 'Is sum ₁ⁿ sqrt a_i le L'. Bulletin of the European Association for Theoretical Computer Science, 28:16-20, February 1986. Technical Contributions.

[Akman, 1991]

V. Akman. Undaunted Sets. Bulletin of the European Association for Theoretical Computer Science, 45:146-147, October 1991. Technical Contributions.

[Alagic and Russell, 2007]

G. Alagic and A. Russell. Quantum computing and the hunt for hidden symmetry. Bulletin of the European Association for Theoretical Computer Science, 93:53--, October 2007. Columns: Complexity.

[Allender and Wagner, 1990]

E.W. Allender and K.W. Wagner. Counting Hierarchies: Polynomial Time and Constant Depth Circuits. Bulletin of the European Association for Theoretical Computer Science, 40:182-194, February 1990. Columns: Structural Complexity.

[Allender, 1985]

Eric Allender. Solutions for problems P90 and P91. Bulletin of the European Association for Theoretical Computer Science, 26:243-244, June 1985. Problems and Solutions.

[Allender, 1998]

E. Allender. News from the Isomorphism Front. Bulletin of the European Association for Theoretical Computer Science, 66:73-82, October 1998. Columns: Computational Complexity.

[Allender, 2001]

E. Allender. The Division Breakthroughs. Bulletin of the European Association for Theoretical Computer Science, 74:61--, June 2001. Columns: Computational Complexity.

[Alt and van Leeuwen, 1979]

Helmut Alt and Jan van Leeuwen. A Classroom Note on Computing Products in Finite-Dimensional Algebras. Bulletin of the European Association for Theoretical Computer Science, 8:14-17, June 1979. Technical Contributions.

[Alt and Wagener, 1988]

Helmut Alt and Hubert Wagener. Approximation of Polygons by Rectangles and Circles. Bulletin of the European Association for Theoretical Computer Science, 36:103-113, October 1988. Technical Contributions.

[Amano, 2010]

K. Amano. Researching the Complexity of Boolean Functions with Computers. Bulletin of the European Association for Theoretical Computer Science, 101:64-91, June 2010. Columns: Complexity.

[Ambühl et al., 2008]

C. Ambühl, M. Mastrolilli, N. Mutsanas, and O. Svensson. Precedence constraint scheduling and connections to dimension theory of partial orders. Bulletin of the European Association for Theoretical Computer Science, 95:37--, June 2008. Columns: Algorithmics.

[America, 1986]

P. America. Object-oriented programming: a theoretician's introduction. Bulletin of the European Association for Theoretical Computer Science, 29:69-84, June 1986. Surveys and Tutorials.

[Amos, 1999]

M. Amos. Theoretical and Experimental DNA Computation. Bulletin of the European Association for Theoretical Computer Science, 67:125-138, February 1999. Columns: Natural Computing.

[Andova and Baeten, 2002]

S. Andova and J.C.M. Baeten. Alternative composition does not imply non-determinism. Bulletin of the European Association for Theoretical Computer Science, 76:125-127, February 2002. Columns: Concurrency.

[Anonymous07, 2007]

Relabeling and the independence theorem in the double-pushout approach to graph transformations. Bulletin of the European Association for Theoretical Computer Science, 91:208, February 2007. Technical Contributions.

[Anonymous99, 1999]

Guidelines for ICALP Organization Proposals. Bulletin of the European Association for Theoretical Computer Science, 68:18--, June 1999. ICALP.

[Antoni et al., 1995]

G. Degli Antoni, D. Cabianca, M. Vaccari, M. Benini, and F. Casablanca. Linearity of Client/Server Systems. Bulletin of the European Association for Theoretical Computer Science, 57:201-214, October 1995. Technical Contributions.

[Antonik et al., 2008]

A. Antonik, M. Huth, K.G. Larsen, U. Nyman, and A. Wasowski. 20 Years of modal and mixed specifications. Bulletin of the European Association for Theoretical Computer Science, 95:94--, June 2008. Columns: Concurrency.

[Apt and Imielinski, 1985]

Krzystof R. Apt and Tomasz Imielinski. Witold Lipski (1949-1985). Bulletin of the European Association for Theoretical Computer Science, 27:258, October 1985. Obituaries.

[Apt and Zuck, 2010]

K.R. Apt and L.D. Zuck. Obituary: Amir Pnueli (1941-2009). Bulletin of the European Association for Theoretical Computer Science, 100:9--, February 2010.

[Apt et al., 1981]

K.R. Apt, C. Bongers, and M. Stefanski. On the compactification of programs. Bulletin of the European Association for Theoretical Computer Science, 14:37-39, June 1981. Technical Contributions.

[Apt, 2003]

K. Apt. Edsger Wybe Dijkstra (1930-2002): A Portrait of a Genius. Bulletin of the European Association for Theoretical Computer Science, 79:290--, February 2003.

[Archangelsky, 1997]

Konstantin V. Archangelsky. A new representation for the regular languages. Bulletin of the European Association for Theoretical Computer Science, 63:135-138, October 1997. Technical Contributions.

[Archangelsky, 2000]

K.V. Archangelsky. The length of homogeneous subwords in rational formal power series. Bulletin of the European Association for Theoretical Computer Science, 71:253--, June 2000. Problems and Solutions.

[Arnborg and Proskurowski, 1985]

S. Arnborg and A. Proskurowski. Problems on graphs with bounded decomposability. Bulletin of the European Association for Theoretical Computer Science, 25 25:7-11, February 1985. Technical Contributions.

[Arnold and Karpinski, 1980]

A. Arnold and M. Karpinski. An easy improvement of Bergstra-Meyer's 81 equations bound for data specifications. Bulletin of the European Association for Theoretical Computer Science, 12:7-9, October 1980. Technical Contributions.

[Arnold and Priese, 1980]

Andre Arnold and Lutz Priese. A comment on some existing simulation conceptions for (concurrent) systems. Bulletin of the European Association for Theoretical Computer Science, 12:65-66, October 1980. Technical Contributions.

[Arnold et al., 1992]

A. Arnold, A. Dicky, and M. Nivat. A note about minimal non-deterministic automata. Bulletin of the European Association for Theoretical Computer Science, 47:166-169, June 1992. Technical Contributions.

[Arnold, 1983a]

A. Arnold. A Negative Result for Büchi's Automata. Bulletin of the European Association for Theoretical Computer Science, 21:11, October 1983. Technical Contributions.

[Arnold, 1983b]

André Arnold. A Solution to Problem 12. Bulletin of the European Association for Theoretical Computer Science, 19:12-13, February 1983. Technical Contributions.

[Arnold, 1989]

André Arnold. Recognizable Sets of Finite Bilabelled Transition Systems. Bulletin of the European Association for Theoretical Computer Science, 38:123-135, June 1989. Technical Contributions.

[Arrighi, 2003]

P. Arrighi. Quantum Computation explained to my Mother. Bulletin of the European Association for Theoretical Computer Science, 80:134--, June 2003. Columns: Natural Computing.

[Arslanov, 1997]

Asat Arslanov. On a Conjecture of M. Van Lambalgen. Bulletin of the European Association for Theoretical Computer Science, 62:195-198, June 1997. Technical Contributions.

[Arulanandham et al., 2002]

J.J. Arulanandham, C.S. Calude, and M.J. Dinneen. Bead-Sort: A Natural Sorting Algorithm. Bulletin of the European Association for Theoretical Computer Science, 76:153-162, February 2002. Technical Contribution.

[Arvind and Torán, 2005]

V. Arvind and J. Torán. Isomorphism testing: Perspective and open problems. Bulletin of the European Association for Theoretical Computer Science, 86:66--, June 2005. Columns: Complexity.

[Asarin, 2004]

E. Asarin. Challenges in Timed Languages: from applied theory to basic theory. Bulletin of the European Association for Theoretical Computer Science, 83:106-120, June 2004. Columns: Concurrency.

[Aspnes and Ruppert, 2007]

J. Aspnes and E. Ruppert. An introduction to population protocols. Bulletin of the European Association for Theoretical Computer Science, 93:98--, October 2007. Columns: Distributed Computing.

[Aspnes et al., 2006]

J. Aspnes, C. Bush, S. Dolev, P. Fatouroum, C. Georgiou, A. Shvartsman, P. Spirakis, and R. Wattenhofer. Eight Open Problems in Distributed Computing. Bulletin of the European Association for Theoretical Computer Science, 90:109-125, October 2006. Columns: Distributed Computing.

[Assous and Charetton, 1990]

R. Assous and C. Charetton. Nice labelling of event structures. Bulletin of the European Association for Theoretical Computer Science, 41:184-190, June 1990. Technical Contributions.

[Asveld, 1984]

Peter R. J. Asveld. Remarks on Defining the Complement of a Language. Bulletin of the European Association for Theoretical Computer Science, 22:5-7, February 1984. Technical Contributions.

[Asveld, 1988]

Peter R. J. Asveld. On a Post's System of Tag. Bulletin of the European Association for Theoretical Computer Science, 36:96-102, October 1988. Technical Contributions.

[Asveld, 1994]

P.R.J. Asveld. An Alternative Formulation of Cocke-Younger-Kasami's Algorithm. Bulletin of the European Association for Theoretical Computer Science, 53:213-216, June 1994. Technical Contributions.

[Asveld, 1996]

P.R.J. Asveld. A Bibliography on Fuzzy Automata, Grammars and Languages. Bulletin of the European Association for Theoretical Computer Science, 58:187-196, February 1996. Bibliographies.

[Attiya, 2010]

H. Attiya. Robust Simulation of Shared Memory: 20 Years After. Bulletin of the European Association for Theoretical Computer Science, 100, February 2010. Columns: Distributed Computing.

[Auramo et al., 1994]

Y. Auramo, J. Katajainen, and J. Kulmala. Finding the Maximum in Parallel Random Access Machines. Bulletin of the European Association for Theoretical Computer Science, 52:315-334, February 1994. Surveys and Tutorials.

[Autebert et al., 1979]

J. M. Autebert, J. Beauquier, and L. Boasson. Some Remarks about Minimal Rational Cones. Bulletin of the European Association for Theoretical Computer Science, 8:13, June 1979. Technical Contributions.

[Autebert et al., 1984]

J.M. Autebert, L. Boasson, and J. Gabarró. Context-free grammars in Greibach normal forms. Bulletin of the European Association for Theoretical Computer Science, 24:44-47, October 1984. Technical Contributions.

[Baaz and Zach, 1992]

M. Baaz and R. Zach. Note on calculi for a three-valued logic for logic programming. Bulletin of the European Association for Theoretical Computer Science, 48:157-164, October 1992. Technical Contributions.

[Baaz et al., 1993]

M. Baaz, C.G. Fermüller, and R. Zach. Dual systems of sequents and tableaux for many-valued logics. Bulletin of the European Association for Theoretical Computer Science, 51:192-197, October 1993. Technical Contributions.

[Bäck et al., 1997]

Thomas Bäck, Jeannette M. de Graaf, Joost N. Kok, and Walter A. Kosters. Theory of Genetic Algorithms. Bulletin of the European Association for Theoretical Computer Science, 63:161-192, October 1997. Surveys and Tutorials.

[Bäck, 2002]

Th. Bäck. Evolutionary Computation: A Guided Tour. Bulletin of the European Association for Theoretical Computer Science, 77:132--, June 2002. Columns: Natural Computing.

[Backhouse and Anderson, 1979]

Roland Backhouse and Stuart Anderson. Least-Cost Repair of Syntax Errors. Bulletin of the European Association for Theoretical Computer Science, 7:10-14, February 1979. Technical Contributions.

[Backhouse and Malcolm, 1990]

R. Backhouse and G. Malcolm. On induced congruences. Bulletin of the European Association for Theoretical Computer Science, 40:201-206, February 1990. Technical Contributions.

[Backhouse et al., 1988a]

Roland Backhouse, Paul Chisholm, and Grant Malcolm. Do-it-yourself Type Theory (Part 1). Bulletin of the European Association for Theoretical Computer Science, 34:68-110, February 1988. Surveys and Tutorials.

[Backhouse et al., 1988b]

Roland Backhouse, Paul Chisholm, and Grant Malcolm. Do-it-yourself Type Theory (Part 2). Bulletin of the European Association for Theoretical Computer Science, 35:205-245, June 1988. Surveys and Tutorials.

[Backhouse, 1989]

Roland Backhouse. Making Formality Work for Us. Bulletin of the European Association for Theoretical Computer Science, 38:219-249, June 1989. Surveys and Tutorials.

[Baena-Garcia et al., 2005]

M. Baena-Garcia, R. Morales-Bueno, J.L. Pérez de-la Cruz, I. Fortes-Ruiz, and L. Mora-López. Busy Beaver Function in LOOP. Bulletin of the European Association for Theoretical Computer Science, 85:165-178, February 2005. Technical Contributions.

[Balanescu, 1984]

T. Balanescu. A proof rule for the 'it ti' generalized control structure. Bulletin of the European Association for Theoretical Computer Science, 24:48-53, October 1984. Technical Contributions.

[Balcázar and gabarro, 1986]

J.L. Balcázar and J. gabarro. Some comments about notations of orders of magnitude. Bulletin of the European Association for Theoretical Computer Science, 30:34-42, October 1986. Technical Contributions.

[Balcazar et al., 1984]

J. L. Balcazar, J. Díaz, and K. Gabarró. Some Results about Logspace Complexity Measures. Bulletin of the European Association for Theoretical Computer Science, 22:8, February 1984. Technical Contributions.

[Balcázar et al., 1985]

J.L. Balcázar, J. Díaz, and J. Gabarró. Examples of CFI-BI-immune and CF-levelable sets in logspace. Bulletin of the European Association for Theoretical Computer Science, 25:11-14, February 1985. Technical Contributions.

[Baratella and Filè, 1988]

Stefano Baratella and Gilberto Filè. A Completeness Result for SLDNF Resolution. Bulletin of the European Association for Theoretical Computer Science, 35:97-105, June 1988. Technical Contributions.

[Barnard et al., 1991]

D.T. Barnard, J.P. Schmeiser, and D.B. SDkilicorn. Deriving Associative Operators for Language Recognition. Bulletin of the European Association for Theoretical Computer Science, 43:131-139, February 1991. Technical Contributions.

[Bartol et al., 1997]

W. Bartol, E. Orlowska, and A. Skowron. Helena Rasiowa, 1917-1994. Bulletin of the European Association for Theoretical Computer Science, 62:353-366, June 1997.

[Barz and Zima, 1979]

H. W. Barz and H. P. Zima. A Bibliography of Parallel Processing. Bulletin of the European Association for Theoretical Computer Science, 8:25-56, June 1979. Technical Contributions.

[Baumer et al., 2001]

S. Baumer, J.L. Esteban, and J. Torán. Minimally Unsatisfiable CNF Formulas. Bulletin of the European Association for Theoretical Computer Science, 74:190--, June 2001. Technical Contributions.

[Beame and Pitassi, 1998]

P. Beame and T. Pitassi. Propositional Proof Complexity: Past, Present and Future. Bulletin of the European Association for Theoretical Computer Science, 65:66--, June 1998. Columns: Computational Complexity.

[Bednarczyk, 1988]

Marek A. Bednarczyk. On Minimal Finite Automata. Bulletin of the European Association for Theoretical Computer Science, 36:113-115, October 1988. Technical Contributions.

[Bednarczyk, 1989]

Marek A. Bednarczyk. On Minimal Finite Automata - Corrigenda. Bulletin of the European Association for Theoretical Computer Science, 38:135-136, June 1989. Technical Contributions.

[Beggs et al., 2009]

E. Beggs, J.F Costa, and V. Tucker. Physical Experiments as Oracles. Bulletin of the European Association for Theoretical Computer Science, 97:137--, February 2009. Columns: Natural Computing.

[Beltrame and Staniszkis, 1990]

G. Beltrame and M. Staniszkis. The generalized prefix property. Bulletin of the European Association for Theoretical Computer Science, 41:191-196, June 1990. Technical Contributions.

[Ben-Amram, 1998]

Amir M. Ben-Amram. Introducing: Reasonable Complete Programming Languages. Bulletin of the European Association for Theoretical Computer Science, 64:153-155, February 1998. Technical Contributions.

[Benson, 1987]

David B. Benson. Concurrency and Interleaving are Equally Fundamental. Bulletin of the European Association for Theoretical Computer Science, 33:54-55, October 1987. Technical Contributions.

[Benson, 1996]

David Benson. Courses on Concurrency. Bulletin of the European Association for Theoretical Computer Science, 59:133-136, June 1996. Columns: Concurrency.

[Bentley, 1979]

Jon Louis Bentley. Priority Queues with range restriction. Bulletin of the European Association for Theoretical Computer Science, 9:7-8, October 1979. Technical Contributions.

[Berenguer and Diaz, 1980]

X. Berenguer and J. Diaz. Computing minimal weight vertex covers in bipartite graphs. Bulletin of the European Association for Theoretical Computer Science, 10:49-52, January 1980. Technical Contributions.

[Bergstra and Meyer, 1981]

J.A. Bergstra and J.-J. Ch. Meyer. An equational class of I/O-computable datastructures that containes no recursive datastructure. Bulletin of the European Association for Theoretical Computer Science, 13:25-30, February 1981. Technical Contributions.

[Bergstra and Terlouw, 1981]

J.A. Bergstra and J. Terlouw. A propositional version of Hoare's logic. Bulletin of the European Association for Theoretical Computer Science, 14:18-25, June 1981. Technical Contributions.

[Bergstra and Tucker, 1980]

J.A. Bergstra and J.V. Tucker. A natural data type with a finite equational final semantics specification but no effective equational initial semantics specification. Bulletin of the European Association for Theoretical Computer Science, 11:23-33, June 1980. Technical Contributions.

[Bergstra, 1982]

Jan Bergstra. A propositional version of Hoare's Logic with modal operators. Bulletin of the European Association for Theoretical Computer Science, 16:2-13, February 1982. Technical Contributions.

[Bergstra, 1983]

Jan Bergstra. Disk Allocation for Cartesian Product Files, a Couterexample. Bulletin of the European Association for Theoretical Computer Science, 20:31-35, June 1983. Technical Contributions.

[Bergstra, 1992]

J. Bergstra. Obituary Wolfgang Wechler. Bulletin of the European Association for Theoretical Computer Science, 46:384, February 1992.

[Berstel and Boasson, 1997]

Jean Berstel and Luc Boasson. The set of Lyndon words is not context-free. Bulletin of the European Association for Theoretical Computer Science, 63:139-140, October 1997. Technical Contributions.

[Berstel and Karhumäki, 2003]

J. Berstel and J. Karhumäki. Combinatorics on words -- a tutorial. Bulletin of the European Association for Theoretical Computer Science, 79:178--, February 2003. Surveys and Tutorials.

[Berstel and Perrin, 1986]

J. Berstel and D. Perrin. Trends in the theory of codes. Bulletin of the European Association for Theoretical Computer Science, 29:84-95, June 1986. Surveys and Tutorials.

[Berstel, 1989]

Jean Berstel. Langford Strings are Squarefree. Bulletin of the European Association for Theoretical Computer Science, 37:127-129, February 1989. Technical Contributions.

[Bertol and Reinhardt, 1995]

Michael Bertol and Klaus Reinhardt. The Tautologies over a Finite Set are Context-Free. Bulletin of the European Association for Theoretical Computer Science, 57:196-197, October 1995. Technical Contributions.

[Bertoni and Sabadini, 1988]

A. Bertoni and N. Sabadini. Generating Functions of Trace Languages. Bulletin of the European Association for Theoretical Computer Science, 35:106-112, June 1988. Technical Contributions.

[Bertoni et al., 1979]

A. Bertoni, G. Mauri, P. A. Miglioli, and M. Wirsing. On Different Approaches to Abstract Data Types and the Existence of Recursive Models. Bulletin of the European Association for Theoretical Computer Science, 9:47-57, October 1979. Technical Contributions.

[Bertoni et al., 1991]

A. Bertoni, P. Campadelli, and G. Mauri. Some Notes on Computational Learning Theory. Bulletin of the European Association for Theoretical Computer Science, 43:140-158, February 1991. Technical Contributions.

[Best, 1982]

E. Best. Representing a Program Invariant as a Linear Invariant in a Petri Net. Bulletin of the European Association for Theoretical Computer Science, 17:2-11, June 1982. Technical Contributions.

[Bezem and Coquand, 2003]

M. Bezem and Th. Coquand. Newman's lemma -- a case study in proof automation and geometric logic. Bulletin of the European Association for Theoretical Computer Science, 79:86--, February 2003. Columns: Logic in Computer Science.

[Bibel, 1980]

Wolfgang Bibel. A theoretical basis for the systematic proof method. Bulletin of the European Association for Theoretical Computer Science, 11:11, June 1980. Technical Contributions.

[Bilò, 2010]

V. Bilò. One-Round Walks in Linear Congestion Games. Bulletin of the European Association for Theoretical Computer Science, 101:45-63, June 2010. Columns: Algorithmic Game Theory.

[Blab, 1982]

Maurice Blab. Some Remarks on 'Non-regular C.F.L. and Pumping'. Bulletin of the European Association for Theoretical Computer Science, 17:11-13, June 1982. Technical Contributions.

[Blass and Gurevich, 2000a]

A. Blass and Y. Gurevich. A New Zero-One Law and Strong Extension Axioms. Bulletin of the European Association for Theoretical Computer Science, 72:103--, October 2000. Columns: Logic in Computer Science.

[Blass and Gurevich, 2000b]

A. Blass and Y. Gurevich. The Underlying Logic of Hoare Logic. Bulletin of the European Association for Theoretical Computer Science, 70:82-110, February 2000. Columns: Logic in Computer Science.

[Blass and Gurevich, 2002a]

A. Blass and Y. Gurevich. Algorithms vs. Machines. Bulletin of the European Association for Theoretical Computer Science, 77:96--, June 2002. Columns: Logic in Computer Science.

[Blass and Gurevich, 2002b]

A. Blass and Y. Gurevich. Pairwise Testing. Bulletin of the European Association for Theoretical Computer Science, 78:100--, October 2002. Columns: Logic in Computer Science.

[Blass and Gurevich, 2003]

A. Blass and Y. Gurevich. Algoritms: A Quest for Absolute Definitions. Bulletin of the European Association for Theoretical Computer Science, 81:195-225, October 2003. Columns: Logic in Computer Science.

[Blass and Gurevich, 2004]

A. Blass and Y. Gurevich. Why Sets? Bulletin of the European Association for Theoretical Computer Science, 84:139-156, October 2004. Columns: Logic in Computer Science.

[Blass and Gurevich, 2007a]

A. Blass and Y. Gurevich. Background of computation. Bulletin of the European Association for Theoretical Computer Science, 92:82-114, June 2007. Columns: Logics in Computer Science.

[Blass and Gurevich, 2007b]

A. Blass and Y. Gurevich. Zero-one laws: thesauri and parametric conditions. Bulletin of the European Association for Theoretical Computer Science, 91:125, February 2007. Columns: Logics in Computer Science.

[Blass and Rossman, 2005]

A. Blass and B. Rossman. Explicit graphs with extension properties. Bulletin of the European Association for Theoretical Computer Science, 86:166--, June 2005. Columns: Logic in Computer Science.

[Blass et al., 2008]

A. Blass, , and Y. Gurevich. Two forms of one useful logic: existential fixed point logic and liberal datalog. Bulletin of the European Association for Theoretical Computer Science, 95:164--, June 2008. Columns: Logics in Computer Science.

[Blass et al., 2010]

A. Blass, Y. Gurevich, and E. Hudis. The Tower-of-Babel Problem, and Security Assessment Sharing. Bulletin of the European Association for Theoretical Computer Science, 101:161-182, June 2010. Columns: Logics in Computer Science.

[Blass, 1988]

Andreas Blass. Topoi and Computation. Bulletin of the European Association for Theoretical Computer Science, 36:57-65, October 1988. Columns: Logic in Computer Science.

[Blesa and Georgiou, 2006]

M.J. Blesa and C. Georgiou. A report from DISC2005, the 19th international symposium on distributed computing. Bulletin of the European Association for Theoretical Computer Science, 88:84-103, February 2006. Columns: Distributed Computing.

[Blikle, 1985]

A. Blikle. Witold Lipski (1949-1985). Bulletin of the European Association for Theoretical Computer Science, 27:258-259, October 1985. Obituaries.

[Bloom and Esik, 1984]

S.L. Bloom and Z. Esik. Some vrieties of iteration theories. Bulletin of the European Association for Theoretical Computer Science, 24:53-66, October 1984. Technical Contributions.

[Bloom and Esik, 1991]

S.L. Bloom and Z. Esik. Cayley iff Stone. Bulletin of the European Association for Theoretical Computer Science, 43:159-161, February 1991. Technical Contributions.

[Bloom and Ésik, 1996]

Stephen L. Bloom and Zoltán Ésik. Two Axiomatizations of a Star Semiring Quasi-Variety. Bulletin of the European Association for Theoretical Computer Science, 59:150-152, June 1996. Technical Contributions.

[Blumer et al., 1983]

A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, and R. MaConnell. Linear Size Finite Automata for the Set of all Subwords of a Word. An Outline of Results. Bulletin of the European Association for Theoretical Computer Science, 21:12-20, October 1983. Technical Contributions.

[Boasson, 1976]

L. Boasson. Sur une transduction rationelle. Bulletin of the European Association for Theoretical Computer Science, 2:11-14, December 1976. Short Research Notes.

[Boasson, 1978]

L. Boasson. A Remark on Ogden's Lemma. Bulletin of the European Association for Theoretical Computer Science, 4:3-4, January 1978. Technical Contributions.

[Boasson, 1980]

L. Boasson. Conjugates and C.F. languages. Bulletin of the European Association for Theoretical Computer Science, 11:12-13, June 1980. Technical Contributions.

[Boasson, 1983]

L. Boasson. An Answer to P12: www^R is cube-free. Bulletin of the European Association for Theoretical Computer Science, 19:13-14, February 1983. Technical Contributions.

[Bodei et al., 2000]

C. Bodei, P. Degano, F. Nielson, and H.R. Nielson. Security Analysis using Flow Logics. Bulletin of the European Association for Theoretical Computer Science, 70:112-129, February 2000. Columns: Concurrency.

[Bodlaender and de Fluiter, 1997]

Hans L. Bodlaender and Babette de Fluiter. A Problem on Strings with an Application to Intervalizing Colored Graphs. Bulletin of the European Association for Theoretical Computer Science, 62:323-324, June 1997. Problems and Solutions.

[Bodlaender, 1988]

H. L. Bodlaender. Some Classes of Graphs with Bounded Treewidth. Bulletin of the European Association for Theoretical Computer Science, 36:116-126, October 1988. Technical Contributions.

[Böhm, 2001]

C. Böhm. Gleaning the Past and the Future in Computer Science. Bulletin of the European Association for Theoretical Computer Science, 74:178--, June 2001. Reflections.

[Böhme and Manthey, 2003]

M. Böhme and B. Manthey. The Computational Power of Compiling C++. Bulletin of the European Association for Theoretical Computer Science, 81:164-270, October 2003. Technical Contributions.

[Bollig, 2009]

B. Bollig. Integer Multiplication and the Complexity of Binary Decision Diagrams. Bulletin of the European Association for Theoretical Computer Science, 98:78--, June 2009. Columns: Complexity.

[Boneva et al., 2009]

I. Boneva, J. Kreike, M. Kurbán, and A. Rensik. Graph Abstraction for a Modal Logic. Bulletin of the European Association for Theoretical Computer Science, 97:106--, February 2009. Columns: Formal Specification.

[Book and Watanabe, 1989]

Ronald V. Book and Osamu Watanabe. A View of Structural Complexity Theory. Bulletin of the European Association for Theoretical Computer Science, 39:122-138, October 1989. Columns: Structural Complexity.

[Book, 1980]

Ronald V. Book. Remarks on linear context-free languages. Bulletin of the European Association for Theoretical Computer Science, 10:30-31, January 1980. Technical Contributions.

[Book, 1981]

Ronald V. Book. Context-sensitive tally languages. Bulletin of the European Association for Theoretical Computer Science, 15:31-34, October 1981. Technical Contributions.

[Boonyavatana and Slutzki, 1986]

R. Boonyavatana and G. Slutzki. A generalized Ogden's lemma for linear context-free languages. Bulletin of the European Association for Theoretical Computer Science, 28:20-26, February 1986. Technical Contributions.

[Boonyavatana and Slutzki, 1987]

R. Boonyavatana and G. Slutzki. Note: On the sufficiency of Igarashi's conditions for real-time deterministic context-free languages. Bulletin of the European Association for Theoretical Computer Science, 31:9-11, February 1987. Technical Contributions.

[Börger and Huggins, 1998]

Egon Börger and James K. Huggins. Abstract State Machines 1988-1998: Commented ASM Bibliography. Bulletin of the European Association for Theoretical Computer Science, 64:105-127, February 1998. Columns: Formal Specification.

[Börger and Karpinksy, 1980]

E. Börger and M. Karpinksy. On the Collatz-like rational games, Post factor replacement and commutative semi-Thue systems. Bulletin of the European Association for Theoretical Computer Science, 12:10-12, October 1980. Technical Contributions.

[Born et al., 2006]

A. Born, C.A.J. Hurkens, and G.J. Woeginger. The Freudenthal Problem and its Ramifications (Part I). Bulletin of the European Association for Theoretical Computer Science, 90:175-191, October 2006. Technical Contributions.

[Born et al., 2007]

A. Born, C.A.J. Hurkens, and G.J. Woeginger. The Freudenthal Problem and its Ramifications (Part II). Bulletin of the European Association for Theoretical Computer Science, 91:189, February 2007. Technical Contributions.

[Borne et al., 2008]

A. Borne, C.A.J. Hurkens, and G.J. Woeginger. The Freudenthal problem and its ramifications (part III). Bulletin of the European Association for Theoretical Computer Science, 95:201--, June 2008. Technical Contributions.

[Boros et al., 2007]

E. Boros, Y. Crama, and B. Simeone. Peter L. Hammer (1936-2006). Bulletin of the European Association for Theoretical Computer Science, 91:227, February 2007. Obituary.

[Bouali et al., 1994]

A. Bouali, S. Gnesi, and S. Larosa. JACK: Just Another Concurrency Kit. Bulletin of the European Association for Theoretical Computer Science, 54:207-224, October 1994. Technical Contributions.

[Boudol, 1989]

Gérard Boudol. Atomic Actions (note). Bulletin of the European Association for Theoretical Computer Science, 38:136-144, June 1989. Technical Contributions.

[Bouyer and Chevalier, 2006]

P. Bouyer and F. Chevalier. On the Control of Timed and Hybrid Systems. Bulletin of the European Association for Theoretical Computer Science, 89:79, June 2006. Columns: Concurrency.

[Bra and Paredaens, 1982]

P. De Bra and J. Paredaens. A Note on Armstrong's Relation. Bulletin of the European Association for Theoretical Computer Science, 17:13-17, June 1982. Technical Contributions.

[Brandt and Walter, 2001]

U. Brandt and H.K.-G. Walter. The Cocke-Younger-Kasami Algorithm -- Revised --. Bulletin of the European Association for Theoretical Computer Science, 74:193--, June 2001. Technical Contributions.

[Brauer and Brauer, 1989]

Ute Brauer and Wilfried Brauer. A New Approach to the Jeep Problem. Bulletin of the European Association for Theoretical Computer Science, 38:145-154, June 1989. Technical Contributions.

[Brauer and Brauer, 1997]

Ute Brauer and Wilfried Brauer. Silver Jubilee of EATCS. Bulletin of the European Association for Theoretical Computer Science, 62:3-23, June 1997. EATCS Matters.

[Brauer et al., 2003]

W. Brauer, M. Holzer, B. König, and S. Schwoon. The theory of finite-state adventures. Bulletin of the European Association for Theoretical Computer Science, 79:230--, February 2003. Education Matters.

[Brauer, 1988]

W. Brauer. On Minimizing Finite Automata. Bulletin of the European Association for Theoretical Computer Science, 35:113-116, June 1988. Technical Contributions.

[Brauer, 1989]

Wilfried Brauer. A Remark on a Note by M.A. Bednarczyk. Bulletin of the European Association for Theoretical Computer Science, 37:129, February 1989. Technical Contributions.

[Bridges and Dediu, 1997]

Douglas Bridges and Luminita Dediu. Paradise lost, or paradise regained? Bulletin of the European Association for Theoretical Computer Science, 63:141-155, October 1997. Technical Contributions.

[Bridges, 2002]

D.S. Bridges. Reality and Virtual Reality in Mathematics. Bulletin of the European Association for Theoretical Computer Science, 78:221--, October 2002. Technical Contributions.

[Broy and Tarlecki, 1985]

Manfred Broy and Andrzej Tarlecki. Algebraic specification of the abstract data type 'continuum'. Bulletin of the European Association for Theoretical Computer Science, 26:32-35, June 1985. Technical Contributions.

[Broy and Wirsing, 1980]

M. Broy and M. Wirsing. Partial recursive functions and abstract data types. Bulletin of the European Association for Theoretical Computer Science, 11:34-41, June 1980. Technical Contributions.

[Broy and Wirsing, 1988]

Manfred Broy and Martin Wirsing. Ultra-loose Algebraic Specification. Bulletin of the European Association for Theoretical Computer Science, 35:117-128, June 1988. Technical Contributions.

[Brukman et al., 2008]

O. Brukman, S. Dolev, Y. Haviv, L. Lahiani, R. Kat, E.M. Schiller, N. Tzachar, and R. Yagel. Self-stabilization from theory to practice. Bulletin of the European Association for Theoretical Computer Science, 94:130--, February 2008. Columns: Distributed Computing.

[Bruni et al., 2008]

R. Bruni, A. Lluch Lafuente, and U. Montanari. Style-based architectural reconfigurations. Bulletin of the European Association for Theoretical Computer Science, 94:161--, February 2008. Columns: Formal Specification.

[Bruyère, 1992]

V. Bruyère. Research topics in the theory of codes. Bulletin of the European Association for Theoretical Computer Science, 48:412-424, October 1992. Problems and Solutions.

[Brzozowski and Seger, 1990]

J.A. Brzozowski and C.-J.H. Seger. Advances in Asynchronous Circuit Theory, Part I: Gate and Unbounded Inertial Delay Models. Bulletin of the European Association for Theoretical Computer Science, 42:198-249, October 1990. Surveys and Tutorials.

[Brzozowski and Seger, 1991]

J.A. Brzozowski and C.-J.H. Seger. Advances in Asynchronous Circuit Theory Part II: Bounded Inertial Delay Models, MOS Circuits, Design Techniques. Bulletin of the European Association for Theoretical Computer Science, 43:199-263, February 1991. Surveys and Tutorials.

[Brzozowski, 1989]

J. A. Brzozowski. Minimization by Reversal is not New. Bulletin of the European Association for Theoretical Computer Science, 37:130, February 1989. Technical Contributions.

[Bucher, 1980]

W. Bucher. A density problem for context-free languages. Bulletin of the European Association for Theoretical Computer Science, 10:53, January 1980. Technical Contributions.

[Budach et al., 1989]

Lothar Budach, Ernst-Günther Giessmann, Hubert Grassmann, Bernd Graw, Christoph Meinel, Burkhard Molzan, Uwe Schäfer, and Pieter Zienicke. Recursive VLSI Design and Application. Bulletin of the European Association for Theoretical Computer Science, 37:131-150, February 1989. Technical Contributions.

[Buffoli et al., 1995]

F. Buffoli, G. Degli Antoni, and A. Marchese. OR-Parallellism in Theorem Proving: Speedups versus Timeout. Bulletin of the European Association for Theoretical Computer Science, 55:158-165, February 1995. Technical Contributions.

[Buhrman and Torenvliet, 2005]

H. Buhrman and L. Torenvliet. A Post's Program for Complexity Theory. Bulletin of the European Association for Theoretical Computer Science, 85:41-51, February 2005. Columns: Computational Complexity.

[Buhrman, 2000]

H. Buhrman. Quantum Computing and Communication Complexity. Bulletin of the European Association for Theoretical Computer Science, 70:131-141, February 2000. Columns: Natural Computing.

[Bunke, 1980]

Horst Bunke. Graph rewriting systems as a tool for transforming descriptions of line drawings. Bulletin of the European Association for Theoretical Computer Science, 12:46-50, October 1980. Technical Contributions.

[Bunke, 1982]

Horst Bunke. Representation of control in parallel programmed grammars. Bulletin of the European Association for Theoretical Computer Science, 16:13-22, February 1982. Technical Contributions.

[Bunke, 1983]

H. Bunke. What is the Distance between Graphs? Bulletin of the European Association for Theoretical Computer Science, 20:35-39, June 1983. Technical Contributions.

[Burkart and Esparza, 1997]

Olaf Burkart and Javier Esparza. More Infinite Results. Bulletin of the European Association for Theoretical Computer Science, 62:138-159, June 1997. Columns: Concurrency.

[Buro and Büning, 1993]

M. Buro and H. Kleine Büning. Report on a SAT Competition. Bulletin of the European Association for Theoretical Computer Science, 49:143-151, February 1993. Technical Contributions.

[Buscarol, 1978]

Mauro Buscarol. First results about Perrin & Schützenberger conjecture. Bulletin of the European Association for Theoretical Computer Science, 6:7-8, October 1978. Technical Contributions.

[Busch et al., 2000]

C. Busch, N. Demetriou, M. Herlihy, and M. Mavronicolas. A Combinatorial Characterization of Properties Preserved by Antitokens. Bulletin of the European Association for Theoretical Computer Science, 71:114--, June 2000. Columns: Distributed Computing.

[Busch et al., 2005a]

C. Busch, M.S. Krishnamoorthy, and M. Magdon-Ismail. Hardness results for cake cutting. Bulletin of the European Association for Theoretical Computer Science, 86:85--, June 2005. Columns: Distributed Computing.

[Busch et al., 2005b]

C. Busch, M. Mavronicolas, and P. Spirakis. An Application of the Monotone Linearizability Lemma. Bulletin of the European Association for Theoretical Computer Science, 85:71-80, February 2005. Columns: Distributed Computing.

[Buzeteanu, 1985]

S. Buzeteanu. Some generalizations of Kleene's second fixed-point theorem. Bulletin of the European Association for Theoretical Computer Science, 25:14-19, February 1985. Technical Contributions.

[by A. Russell and Shvartsman, 2002]

by A. Russell and A.A. Shvartsman. Distributed Computation Meets Design Theory: Local Scheduling for Disconnected Cooperation. Bulletin of the European Association for Theoretical Computer Science, 77:120--, June 2002. Columns: Distributed Computing.

[Byers and Pitt, 1990]

P. Byers and D. Pitt. Conservative extensions: a cautionary note. Bulletin of the European Association for Theoretical Computer Science, 41:196-201, June 1990. Technical Contributions.

[Caires, 2008]

L. Caires. Dynamic spatial logics: a tutorial survey. Bulletin of the European Association for Theoretical Computer Science, 94:76--, February 2008. Columns: Concurrency.

[Calude and Calude, 2002]

C.S. Calude and E. Calude. The Bridge Crossing Problem. Bulletin of the European Association for Theoretical Computer Science, 77:180--, June 2002. Technical Contributions.

[Calude and Chitescu, 1984]

C. Calude and I. Chitescu. A class of universal P. Martin-Löf tests. Bulletin of the European Association for Theoretical Computer Science, 23:15-22, June 1984. Technical Contributions.

[Calude et al., 1997]

Cristian S. Calude, Peter H. Hertling, and Bakhadyr Khoussainov. Do the Zeros of Riemann's Zeta-Function Form a Random Sequence? Bulletin of the European Association for Theoretical Computer Science, 62:199-207, June 1997. Technical Contributions.

[Calude et al., 1998]

C.S. Calude, E. Calude, and C. Stefanescu. Computational Complementarity for Mealy Automata. Bulletin of the European Association for Theoretical Computer Science, 66:139-150, October 1998. Technical Contributions.

[Calude et al., 2004]

C.S. Calude, E. Calude, and S. Marcus. Passages of Proof. Bulletin of the European Association for Theoretical Computer Science, 84:167-188, October 2004. Technical Contributions.

[calude, 1983]

Cristian calude. A Simple Non-Uniform Operation. Bulletin of the European Association for Theoretical Computer Science, 20:40-46, June 1983. Technical Contributions.

[Calude, 1986]

C. Calude. Note on Ehrenfeucht's conjecture and Hilbert's basis theorem. Bulletin of the European Association for Theoretical Computer Science, 29:18-22, June 1986. Technical Contributions.

[C^ampeanu, 1996]

C. C^ampeanu. Random Numbers Are Borel Normal. Bulletin of the European Association for Theoretical Computer Science, 58:155-158, February 1996. Technical Contributions.

[Cantone and Cutello, 1989]

D. Cantone and V. Cutello. Decision Procedures for Elementary Sublanguages of Set Theory. XVI. Multilevel Syllogistic Extended by Singleton, Rank Comparison and Unary Intersection. Bulletin of the European Association for Theoretical Computer Science, 39:139-148, October 1989. Technical Contributions.

[Capocelli, 1986]

R.M. Capocelli. Comments on 'Trends in the Theory of Codes' by J. Berstel and D. Perrin. Bulletin of the European Association for Theoretical Computer Science, 30:43-44, October 1986. Technical Contributions.

[Caragiannis et al., 2002]

I. Caragiannis, Ch. Kaklamanis, and P. Persiano. Wavelength Routing in All-Optical Tree Networks: A Survey. Bulletin of the European Association for Theoretical Computer Science, 76:104-123, February 2002. Columns: Distributed Computing.

[Cardelli, 2007]

L. Cardelli. Machines of systems biology. Bulletin of the European Association for Theoretical Computer Science, 93:176--, October 2007. Columns: Natural Computing.

[Carpi, 1983]

Arturo Carpi. A Solution to Berstel's Problem No P1. Bulletin of the European Association for Theoretical Computer Science, 19:2-4, February 1983. Technical Contributions.

[Carpi, 1993]

A. Carpi. Repetitions in the Kolakovski sequence. Bulletin of the European Association for Theoretical Computer Science, 50:194-196, June 1993. Technical Contributions.

[Case and Fulk, 1983]

John Case and Mark Fulk. Solution to Machine Inductive Interference Problem P3. Bulletin of the European Association for Theoretical Computer Science, 19:8, February 1983. Technical Contributions.

[Case, 1982]

John Case. Machine Inductive Interference Problems. Bulletin of the European Association for Theoretical Computer Science, 18:117-118, October 1982. Problems.

[Cassaigne et al., 1992]

J. Cassaigne, S. Schwer, and P. Séébold. About Gauss codes. Bulletin of the European Association for Theoretical Computer Science, 48:165-171, October 1992. Technical Contributions.

[Castellano et al., 1987]

Luca Castellano, Georgio De Michelis, and Lucia Pomello. Concurrency vs Interleaving: an instructive example. Bulletin of the European Association for Theoretical Computer Science, 31:12-15, February 1987. Technical Contributions.

[Chaitin et al., 1995]

G.J. Chaitin, A. Arslanov, and C. Calude. Program-size Complexity Computes the Halting Problem. Bulletin of the European Association for Theoretical Computer Science, 57:198-200, October 1995. Technical Contributions.

[Chaitin, 1993]

G.J. Chaitin. Randomness in arithmetic and the decline and fall or reductionism in pure mathematics. Bulletin of the European Association for Theoretical Computer Science, 50:314-328, June 1993. Surveys and Tutorials.

[Chaitin, 2002]

G.J. Chaitin. Meta-Mathematics and the Foundations of Mathematics. Bulletin of the European Association for Theoretical Computer Science, 77:167--, June 2002. Reflections.

[Chaitin, 2007]

G.J. Chaitin. Speculations on biology, information and complexity. Bulletin of the European Association for Theoretical Computer Science, 91:231, February 2007. Miscellaneous.

[Chaitin, 2009]

G.J. Chaitin. Evolution of mutating software. Bulletin of the European Association for Theoretical Computer Science, 97:157--, February 2009. Miscellaneous.

[Chakaravarthy and Krithivasan, 1997]

Venkatesan T. Chakaravarthy and Kamala Krithivasan. A Note on Extended H Systems with Permitting/Forbidding Contexts of Radius One. Bulletin of the European Association for Theoretical Computer Science, 62:208-213, June 1997. Technical Contributions.

[Chalopin et al., 2005]

J. Chalopin, Y. Metivier, and W. Zielonka. Local Computation in Graphs: The Case of Cellular Edge Local Computations (Short Summary). Bulletin of the European Association for Theoretical Computer Science, 85:105-109, February 2005. Columns: Formal Specification.

[Chang and Rohatgi, 1990]

R. Chang and P. Rohatgi. On Unique Satisfiability and Randomized Reductions. Bulletin of the European Association for Theoretical Computer Science, 42:151-159, October 1990. Columns: Structural Complexity.

[Chang, 1990]

R. Chang. An Example of a Theorem that has Contradictory Relativizations and a Diagonalization Proof. Bulletin of the European Association for Theoretical Computer Science, 42:172-173, October 1990. Technical Contributions.

[Chang, 1994]

R. Chang. A Machine Model for NP-approximation Problems and the Revenge of the Boolean Hierarchy. Bulletin of the European Association for Theoretical Computer Science, 54:166-182, October 1994. Columns: Structural Complexity.

[Chapman, 1992a]

N. Chapman. Teaching theoretical computer science to first year undergraduates. Bulletin of the European Association for Theoretical Computer Science, 48:269-273, October 1992. Educational Matters.

[Chapman, 1992b]

N.P. Chapman. On Extended Attribute Grammars. Bulletin of the European Association for Theoretical Computer Science, 46:140-146, February 1992. Technical Contributions.

[Chatelin, 1986]

P. Chatelin. A bibliography on matrix multiplication complexity and related problems (July 1968- January 1986). Bulletin of the European Association for Theoretical Computer Science, 29:55-69, June 1986. Bibliographies.

[Chattopadhyay, 2010]

A. Chattopadhyay. Multilinear Polynomials Modulo Composites. Bulletin of the European Association for Theoretical Computer Science, 100:52--, February 2010. Columns: Complexity.

[Chatzigiannakis et al., 2002]

I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis. Distributed Communication Algorithms. Bulletin of the European Association for Theoretical Computer Science, 78:133--, October 2002. Columns: Distributed Computing.

[Chazelle and Incerpi, 1984]

Bernard Chazelle and Janet Incerpi. Computing The Connected Components of D-Ranges. Bulletin of the European Association for Theoretical Computer Science, 22:9-11, February 1984. Technical Contributions.

[Chlebus, 1987]

Bogdan S. Chlebus. A note on the polynomial-time hierarchy and the quantified boolean formulas. Bulletin of the European Association for Theoretical Computer Science, 31:15-22, February 1987. Technical Contributions.

[Choffrut, 1990]

C. Choffrut. An optimal algorithm for building the Boyer-Moore automaton. Bulletin of the European Association for Theoretical Computer Science, 40:217-225, February 1990. Technical Contributions.

[Choffrut, 1991]

C. Choffrut. Conjugacies. Bulletin of the European Association for Theoretical Computer Science, 45:148-157, October 1991. Technical Contributions.

[Choffrut, 2006]

C. Choffrut. Relations over Words and Logic: a Chronology. Bulletin of the European Association for Theoretical Computer Science, 89:159, June 2006. Technical Contributions.

[Choquet and Finkel, 1986]

A. Choquet and A. Finkel. Applications of residues for the analysis of parallel systems communicating by fifo channels. Bulletin of the European Association for Theoretical Computer Science, 30:44-57, October 1986. Technical Contributions Technical Contributions.

[Choueka and Peleg, 1983]

Y. Choueka and D. Peleg. A Note on omega -regular languages. Bulletin of the European Association for Theoretical Computer Science, 21:21-23, October 1983. Technical Contributions.

[Christensen and Hüttel, 1993]

S. Christensen and H. Hüttel. Decidability issues for infinite-state processes - a survey. Bulletin of the European Association for Theoretical Computer Science, 51:156-166, October 1993. Columns: Concurrency.

[Christodoulou and Koutsoupias, 2009]

G. Christodoulou and E. Koutsoupias. Mechanism Design for Scheduling. Bulletin of the European Association for Theoretical Computer Science, 97:39--, February 2009. Columns: Algorithmic Game Theory.

[Chytil et al., 1985]

M.P. Chytil, M. Plátek, and J. Vogel. A note on the Chomsky hierarchy. Bulletin of the European Association for Theoretical Computer Science, 27:23-30, October 1985. Technical Contributions.

[Claus, 1980]

Volker Claus. Some remarks on PCP(k) and related problems. Bulletin of the European Association for Theoretical Computer Science, 12:54-61, October 1980. Technical Contributions.

[Claus, 1981]

V. Claus. Two examples to Skolem's problem. Bulletin of the European Association for Theoretical Computer Science, 13:11-12, February 1981. Technical Contributions.

[Cleaveland and Smolka, 1996]

R. Cleaveland and S.A. Smolka. Strategic Directions in Computing Research - Concurrency Working Group Report. Bulletin of the European Association for Theoretical Computer Science, 60:97-122, October 1996. Columns: Concurrency.

[Clementi et al., 1998]

Andrea E.F. Clementi, José D.P. Rolim, and Luca Trevisan. Recent Advances Towards Proving P = BPP. Bulletin of the European Association for Theoretical Computer Science, 64:96-103, February 1998. Columns: Computational Complexity.

[Clerbout, 1985]

M. Clerbout. A solution to Paun's problem P100. Bulletin of the European Association for Theoretical Computer Science, 26:244-246, June 1985. Problems and Solutions.

[Colson, 1998]

L. Colson. Functions versus Algorithms. Bulletin of the European Association for Theoretical Computer Science, 65:98--, June 1998. Columns: Logic in Computer Science.

[Compton and Straubing, 1992]

K.J. Compton and H. Straubing. Characterizations of regular languages in low level complexity classes. Bulletin of the European Association for Theoretical Computer Science, 48:134-142, October 1992. Columns: Logic in Computer Science.

[Compton, 1991]

K.J. Compton. Lower Bounds for the Complexity of Theories. Bulletin of the European Association for Theoretical Computer Science, 43:113-123, February 1991. Columns: Algebraic Specification.

[Constantinescu and Ilie, 2006]

S. Constantinescu and L. Ilie. Fine and Wilf's Theorem for Abelian Periods. Bulletin of the European Association for Theoretical Computer Science, 89:167, June 2006. Technical Contributions.

[Coquand et al., 1994]

Th. Coquand, B. Nordström, J.M. Smith, and B. von Sydow. Type Theory and Programming. Bulletin of the European Association for Theoretical Computer Science, 52:203-228, February 1994. Columns: Logic in Computer Science.

[Corne and reynolds, 2008]

D. Corne and A. reynolds. Swarm intelligence: A tutorial account. Bulletin of the European Association for Theoretical Computer Science, 96:104--, October 2008. Columns: Natural Computing.

[Cornelius, 1999]

F. Cornelius. An Overview of the Distributed System Classification and Integration Framework DeCIF. Bulletin of the European Association for Theoretical Computer Science, 67:82-92, February 1999. Columns: Formal Specification.

[Corradini and Heckel, 2000]

A. Corradini and R. Heckel. Graph Transformation and Visual Modeling Techniques: Workshop Summary and HowTo. Bulletin of the European Association for Theoretical Computer Science, 72:69--, October 2000. Columns: Formal Specification.

[Corradini and Kreowski, 1997]

Andrea Corradini and Hans-Jörg Kreowski. GETGRATS and APPLIGRAPH: Theory and Applications of Graph Transformation. Bulletin of the European Association for Theoretical Computer Science, 63:109-114, October 1997. Columns: Formal Specification.

[Costa and Mycka, 2005]

J.F. Costa and J. Mycka. What Lies Beyond the Mountains. Bulletin of the European Association for Theoretical Computer Science, 85:179--, February 2005. Miscellaneous.

[Courcelle, 1977]

B. Courcelle. The Equivalence Problem for Realtime DPDA's. Bulletin of the European Association for Theoretical Computer Science, 3:6-9, October 1977. Technical Contributions.

[Courcelle, 1983]

B. Courcelle. Recognizing Regular Languages with Rewriting. Bulletin of the European Association for Theoretical Computer Science, 20:47-48, June 1983. Technical Contributions.

[Courcelle, 1988]

Bruno Courcelle. Some Applications of Logic of Universal Algebra, and of Category Theory to the Theory of Graph Transformations. Bulletin of the European Association for Theoretical Computer Science, 36:161-218, October 1988. Surveys and Tutorials.

[Courcelle, 1989]

Bruno Courcelle. Corrections and Additions to: Some Applications of Logic of Universal Algebra, and of Category Theory to the Theory of Graph Transformations. Bulletin of the European Association for Theoretical Computer Science, 37:194-195, February 1989. Surveys and Tutorials.

[Courcelle, 1991]

B. Courcelle. On Constructing Obstruction Sets of Words. Bulletin of the European Association for Theoretical Computer Science, 44:178-185, June 1991. Technical Contributions.

[Courcelle, 1992]

B. Courcelle. Graph Grammars, Monadic Second-Order Logic and the Theory of Graph Minors. Bulletin of the European Association for Theoretical Computer Science, 46:193-226, February 1992. Surveys and Tutorials.

[Courcelle, 1993]

B. Courcelle. Graphs and Monadic Second-Order Logic: Some Open Problems. Bulletin of the European Association for Theoretical Computer Science, 49:110-124, February 1993. Columns: Logic in Computer Science.

[Crochemore and Perrin, 1988]

Maxime Crochemore and Dominique Perrin. Critical Factorizations of Words. Bulletin of the European Association for Theoretical Computer Science, 34:47-52, February 1988. Technical Contributions.

[Crochemore, 1982]

Max Crochemore. A Solution to Berstel's Problem No P3. Bulletin of the European Association for Theoretical Computer Science, 18:9-11, October 1982. Technical Contributions.

[Crochemore, 1983]

Max Crochemore. A Solution to P12 (number 18, October 1982). Bulletin of the European Association for Theoretical Computer Science, 19:15-16, February 1983. Technical Contributions.

[Crochemore, 1984]

M. Crochemore. Linear searching for a square in a word. Bulletin of the European Association for Theoretical Computer Science, 24:66-72, October 1984. Technical Contributions.

[Crochemore, 1986a]

M. Crochemore. Computing LCF in linear time. Bulletin of the European Association for Theoretical Computer Science, 30:57-61, October 1986. Technical Contributions.

[Crochemore, 1986b]

M. Crochemore. Powerfree morphisms. Bulletin of the European Association for Theoretical Computer Science, 30:261-262, October 1986. Problems and Solutions.

[Crochemore, 1989]

Maxime Crochemore. String-Matching and Periods. Bulletin of the European Association for Theoretical Computer Science, 39:149-153, October 1989. Technical Contributions.

[Csuhaj-Varjú and Meduna, 1994]

E. Csuhaj-Varjú and A. Meduna. Grammars with context conditions. Bulletin of the European Association for Theoretical Computer Science, 53:199-212, June 1994. Columns: Formal Language Theory.

[Csuhaj-Varjú and Paun, 1993]

E. Csuhaj-Varjú and G. Paun. Limiting the team size in cooperating grammar systems. Bulletin of the European Association for Theoretical Computer Science, 51:198-202, October 1993. Technical Contributions.

[Csuhaj-Varju and Salomaa, 1998]

E. Csuhaj-Varju and A. Salomaa. Networks of Language Processors: Parallel Communicating Systems. Bulletin of the European Association for Theoretical Computer Science, 66:122-138, October 1998. Columns: Formal Language Theory.

[Csuhaj-Varjú, 1997]

Erzsébet Csuhaj-Varjú. Networks of Language Processors. Bulletin of the European Association for Theoretical Computer Science, 63:120-134, October 1997. Columns: Formal Language Theory.

[Culik and Karhumäki, 1985]

K. Culik, II and J. Karhumäki. Decision problems solved with the help of the Ehrenfeucht conjecture. Bulletin of the European Association for Theoretical Computer Science, 27:30-35, October 1985. Technical Contributions.

[Culik et al., 1982]

Karel Culik, II, J. Gruska, and A. Salomaa. On non-regular context-free languages and pumping. Bulletin of the European Association for Theoretical Computer Science, 16:22-24, February 1982. Technical Contributions.

[Culik, 1981]

K. Culik, II. The omega -equivalence problem for Tag systems with deletion number one is decidable. Bulletin of the European Association for Theoretical Computer Science, 14:6-7, June 1981. Technical Contributions.

[Czeizler and Czeizler, 2006]

E. Czeizler and E. Czeizler. A short survey on Watson-Crick Automata. Bulletin of the European Association for Theoretical Computer Science, 88:104-119, February 2006. Columns: Formal Language Theory.

[Czumaj and Sohler, 2006]

A. Czumaj and C. Sohler. Sublinear-Time Algorithms. Bulletin of the European Association for Theoretical Computer Science, 89:23, June 2006. Columns: Algorithmics.

[da Fonseca et al., 2001]

A.F. da Fonseca, A.H.R. da Silva, M. Ayala-Rincón, H.W. Poubel, and J. de Siqueira. Animation of Relations between Computational Models and Their Language Representations. Bulletin of the European Association for Theoretical Computer Science, 74:235--, June 2001. Educational Matters.

[Dahlhaus and Gaifman, 1985]

E. Dahlhaus and H. Gaifman. Concerning 2-adjacent contextfree languages. Bulletin of the European Association for Theoretical Computer Science, 27:246-248, October 1985. Problems and Solutions Technical Contributions.

[Daley and Smith, 1984]

R.P. Daley and C.H. Smith. On the complexity of inductive inference. Bulletin of the European Association for Theoretical Computer Science, 23:22-28, June 1984. Technical Contributions.

[Damgard, 1999]

I. Damgard. Unconditional Security in Cryptography - was Shannon too Pessimistic? Bulletin of the European Association for Theoretical Computer Science, 68:166-179, June 1999. Surveys and Tutorials.

[Damm, 1998]

C. Damm. A Note on Spectral Lower Bound Arguments for Decision Trees. Bulletin of the European Association for Theoretical Computer Science, 65:136--, June 1998. Technical Contributions.

[Dányi, 2001]

G. Dányi. A component Hierarchy of lambda --, and Chain-free Cooperating Distributed Context Free Grammars. Bulletin of the European Association for Theoretical Computer Science, 74-:205--, June 2001. Technical Contributions.

[Darondeau, 1991]

Ph. Darondeau. Recursive Graphs are not Stable under Maximal Reduction. Bulletin of the European Association for Theoretical Computer Science, 44:186-189, June 1991. Technical Contributions.

[Dassow and Ehrig, 1981]

Jürgen Dassow and Rainer Ehrig. Algebraic considerations on AFL's. Bulletin of the European Association for Theoretical Computer Science, 14:34-36, June 1981. Technical Contributions.

[Dassow and Kelemen, 1991]

J. Dassow and J. Kelemen. Cooperating/Distributed Grammar Systems: a Link between Formal Languages and Artificial Intelligence. Bulletin of the European Association for Theoretical Computer Science, 45:131-145, October 1991. Columns: Formal Language Theory.

[Dassow et al., 1993]

J. Dassow, G. Paun, and A. Salomaa. On Thinness and Slenderness of L Languages. Bulletin of the European Association for Theoretical Computer Science, 49:152-158, February 1993. Technical Contributions.

[Dassow et al., 1999]

J. Dassow, V. Mitrana, and G. Paun. On the Regularity of Duplication Closure. Bulletin of the European Association for Theoretical Computer Science, 69:133-136, October 1999. Technical Contributions.

[Dassow, 1984]

Jürgen Dassow. A Note on DT0L Systems. Bulletin of the European Association for Theoretical Computer Science, 22:11-14, February 1984. Technical Contributions.

[De Felice, 1983]

Clelia De Felice. An Answer to Berstel's Problem N. P2. Bulletin of the European Association for Theoretical Computer Science, 19:5-7, February 1983. Technical Contributions.

[De Felice, 1988]

Clelia De Felice. On the Infinite Completion of Codes. Bulletin of the European Association for Theoretical Computer Science, 34:52-54, February 1988. Technical Contributions.

[de Lara, 2003]

J. de Lara. Meta-Modelling and Graph Transformation for the Simulation of Systems. Bulletin of the European Association for Theoretical Computer Science, 81:180-194, October 2003. Columns: Formal Specification.

[De Luca and restivo, 1986]

A. De Luca and A. restivo. On a generalization of a conjecture of Ehrenfeucht. Bulletin of the European Association for Theoretical Computer Science, 30:84-90, October 1986. Technical Contributions.

[de Luca and Varricchio, 1989]

Aldo de Luca and Stefano Varricchio. A Positive Pumping Condition for Regular Sets. Bulletin of the European Association for Theoretical Computer Science, 39:171-175, October 1989. Technical Contributions.

[de Swart and Ophelders, 1988]

H.C.M. de Swart and W.M.J. Ophelders. Another Tableau Based Automateed Theorem Prover for Classical Logic. Bulletin of the European Association for Theoretical Computer Science, 35:185-197, June 1988. Technical Contributions.

[de Swart, 1989]

H. C. M. de Swart. Improving TABLOG. Bulletin of the European Association for Theoretical Computer Science, 38:211-218, June 1989. Technical Contributions.

[de Vreught, 1992]

J.P.M. de Vreught. Maximal derivation lengths of acyclic CFGs. Bulletin of the European Association for Theoretical Computer Science, 47:206-207, June 1992. Technical Contributions.

[Degtyarev et al., 1996]

A. Degtyarev, Y. Gurevich, and A. Voronkov. Herbrand's Theorem and Equational Reasoning: Problems and Solutions. Bulletin of the European Association for Theoretical Computer Science, 60:97--, October 1996. Columns: Logic in Computer Science.

[Deineko and Woeginger, 2006]

V.G. Deineko and G. Woeginger. Some problems around travelling salesmen, dart boards, and Euro-coins. Bulletin of the European Association for Theoretical Computer Science, 90:43-52, October 2006. Columns: Algorithmics.

[Demetrescu et al., 2003]

C. Demetrescu, I. Finocchi, and G.F. Italiano. Algorithm engineering. Bulletin of the European Association for Theoretical Computer Science, 79:48--, February 2003. Columns: Algorithmics.

[den Bussche, 1990]

J. Van den Bussche. A formal basis for extending SQL to object-oriented databases. Bulletin of the European Association for Theoretical Computer Science, 40:207-216, February 1990. Technical Contributions.

[den Bussche, 2005]

Jan Van den Bussche. First-order Topology Properties. Bulletin of the European Association for Theoretical Computer Science, 87:155-164, October 2005. Columns: Logic in Computer Science.

[Deng, 2007]

Y. Deng. A simple completeness proof for the axiomatisations of weak behavioural equivalences. Bulletin of the European Association for Theoretical Computer Science, 93:207--, October 2007. Technical Contributions.

[Dershowitz and Jouannaud, 1991]

N. Dershowitz and J.-P. Jouannaud. Notations for Rewriting. Bulletin of the European Association for Theoretical Computer Science, 43:162-172, February 1991. Technical Contributions.

[Deussen and Wegner, 1978]

Peter Deussen and Lutz Wegner. Bibliography of van Wijngaarden grammars. Bulletin of the European Association for Theoretical Computer Science, 6:41-46, October 1978. Technical Contributions.

[di Fenizio, 2002]

P. Speroni di Fenizio. Artificial Chemistries. Bulletin of the European Association for Theoretical Computer Science, 76:128-141, February 2002. Columns: Natural Computing.

[Diaz et al., 2007]

O. Diaz, H. Ehrig, C. Ermel, U. Prange, and G. Taentzer. Model transformation should be functors. Bulletin of the European Association for Theoretical Computer Science, 92:75-81, June 2007. Columns: Formal Specification.

[Díaz, 2001]

J. Díaz. H-Colorings of Graphs. Bulletin of the European Association for Theoretical Computer Science, 75:82--, October 2001. Columns: Algorithmics.

[Díaz, 2002a]

J. Díaz. Analysis of Algorithms (AofA): Part I: 1993 -- 1998 (``Dagstuhl Period''). Bulletin of the European Association for Theoretical Computer Science, 77:42--, June 2002. Columns: Algorithmics.

[Díaz, 2002b]

J. Díaz. Primes in P (Without Assumptions). Bulletin of the European Association for Theoretical Computer Science, 78:67--, October 2002. Columns: Algorithmics.

[Diderich, 1993]

C.G. Diderich. A bibliography on Minimax Trees. Bulletin of the European Association for Theoretical Computer Science, 49:195-200, February 1993. Bibliographies.

[Diekert, 1990]

V. Diekert. Research topics in the theory of free partially commutative monoids. Bulletin of the European Association for Theoretical Computer Science, 40:479-491, February 1990. Problems and Solutions.

[Dietzfelbinger and Kunde, 2003]

M. Dietzfelbinger and M. Kunde. A case against using Stirling's formula (unless you really need it). Bulletin of the European Association for Theoretical Computer Science, 80:153--, June 2003. Technical Contributions.

[Dinneen, 1998]

M.J. Dinneen. Group-Theoretic Methods for Designing Networks. Bulletin of the European Association for Theoretical Computer Science, 65:53--, June 1998. News from New Zealand.

[Dom, 2009]

M. Dom. Algorithms Aspects of the Consecutive-Ones Property. Bulletin of the European Association for Theoretical Computer Science, 98:27--, June 2009. Columns: Algorithmics.

[Domaratzki, 2003]

M. Domaratzki. On Iterated Scattered Deletion. Bulletin of the European Association for Theoretical Computer Science, 80:159--, June 2003. Technical Contributions.

[Domaratzki, 2005]

M. Domaratzki. More words on trajectories. Bulletin of the European Association for Theoretical Computer Science, 86:107--, June 2005. Columns: Formal Language Theory.

[Domaratzki, 2006]

M. Domaratzki. Enumeration of Formal Languages. Bulletin of the European Association for Theoretical Computer Science, 89:117, June 2006. Columns: Formal Language Theory.

[Domocos and Hristea, 1993]

V. Domocos and F. Hristea. A codification of column-convex polyominoes which generates a regular language. Bulletin of the European Association for Theoretical Computer Science, 50:197-208, June 1993. Technical Contributions.

[Domocos, 1993]

V. Domocos. The generating function of completely bracketed expressions. Bulletin of the European Association for Theoretical Computer Science, 51:202-211, October 1993. Technical Contributions.

[Dömösi and Horváth, 2005]

Pál Dömösi and Géza Horváth. The Language of Primitive Words in not Regular: Two Simple Proofs. Bulletin of the European Association for Theoretical Computer Science, 87:191-194, October 2005. Technical Contributions.

[Dömösi et al., 1999]

P. Dömösi, S. Okawa, and S. Hirose. A Chomsky and Stanley Type Homomorphic Characterization of the Class of Linear Languages. Bulletin of the European Association for Theoretical Computer Science, 68:151--, June 1999. Technical Contributions.

[Dong and Wong, 1997]

Guozhu Dong and Limsoon Wong. Some Relationships between the FOIES and Sigma-1-1 Arity Hierarchies. Bulletin of the European Association for Theoretical Computer Science, 61:72-79, February 1997. Technical Contributions.

[Downey et al., 1999]

R.G. Downey, M.R. Fellows, and U. Stege. Computational Tractability: The View From Mars. Bulletin of the European Association for Theoretical Computer Science, 69:73-97, October 1999. Columns: Computational Complexity.

[Drewes et al., 1993]

F. Drewes, A. Habel, H.-J. Kreowski, and S. Taubenberger. A Sketch of Collage Grammars. Bulletin of the European Association for Theoretical Computer Science, 50:209-219, June 1993. Technical Contributions.

[Droste and Shortt, 1992]

M. Droste and R.M. Shortt. Bounded Petri nets of finite dimension have only finitely many reachable markings. Bulletin of the European Association for Theoretical Computer Science, 48:172-175, October 1992. Technical Contributions.

[Du et al., 1997]

D.-Z. Du, K.-I Ko, and A. Selman. In Memoriam: Ronald V. Book. Bulletin of the European Association for Theoretical Computer Science, 63:292, October 1997.

[Dúnlaing, 1996]

Colm Ó Dúnlaing. Resolution Proofs viewed as Automata. Bulletin of the European Association for Theoretical Computer Science, 59:153-156, June 1996. Technical Contributions.

[Durand et al., 2009]

B. Durand, A. Romashchenko, and A. Shen. Fixed Point Theorem and Aperiodic Tilings. Bulletin of the European Association for Theoretical Computer Science, 97:126--, February 2009. Columns: Logics in Computer Science.

[EATCS Council, 1986]

EATCS Council. Guidelines for the formation and functioning of ICALP program committees. Bulletin of the European Association for Theoretical Computer Science, 29:3-8, June 1986. EATCS Matters.

[Eberbach and Wegner, 2003]

E. Eberbach and P. Wegner. Beyond Turing Machines. Bulletin of the European Association for Theoretical Computer Science, 81:279-304, October 2003. Technical Contributions.

[Edelsbrunner and van Leeuwen, 1980]

Herbert Edelsbrunner and Jan van Leeuwen. Multidimensional algorithms and data structures (bibliography). Bulletin of the European Association for Theoretical Computer Science, 11:46-74, June 1980. Technical Contributions.

[Edelsbrunner and van Leeuwen, 1981]

Herbert Edelsbrunner and Jan van Leeuwen. Supplement to 'Multidimensional algorithms and data structures (bibliography)'. Bulletin of the European Association for Theoretical Computer Science, 13:79-85, February 1981. Technical Contributions.

[Edelsbrunner, 1981a]

H. Edelsbrunner. A note on dynamic range searching. Bulletin of the European Association for Theoretical Computer Science, 15:34-40, October 1981. Technical Contributions.

[Edelsbrunner, 1981b]

H. Edelsbrunner. Reporting intersections of geometric objects by means of covering rectangles. Bulletin of the European Association for Theoretical Computer Science, 13:7-11, February 1981. Technical Contributions.

[Edelsbrunner, 1985]

Herbert Edelsbrunner. Problems in computational and combinatorial geometry (P103 -- P110). Bulletin of the European Association for Theoretical Computer Science, 26:239, June 1985. Problems and Solutions.

[Edelsbrunner, 1987a]

Herbert Edelsbrunner. ( Conferences, Journals, Books ). Bulletin of the European Association for Theoretical Computer Science, 33:23-24, October 1987. Columns: Computational Geometry.

[Edelsbrunner, 1987b]

Herbert Edelsbrunner. Computational Geometry Column (no. 1). Bulletin of the European Association for Theoretical Computer Science, 31:111-114, February 1987. Columns: Computational Geometry.

[Edelsbrunner, 1987c]

Herbert Edelsbrunner. Geometrics and Algorithmics -- A Tutorial in Computational Geometry. Bulletin of the European Association for Theoretical Computer Science, 32:118-142, June 1987. Surveys and Tutorials.

[Edelsbrunner, 1988a]

Herbert Edelsbrunner. ( On 4th Annual ACM Symposium on Computational Geometry ). Bulletin of the European Association for Theoretical Computer Science, 35:66-68, June 1988. Columns: Computational Geometry.

[Edelsbrunner, 1988b]

Herbert Edelsbrunner. ( The log-function in complexity ). Bulletin of the European Association for Theoretical Computer Science, 34:32-39, February 1988. Columns: Computational Geometry.

[Edelsbrunner, 1989a]

Herbert Edelsbrunner. ( Impact of Computational Geometry in the Classroom ). Bulletin of the European Association for Theoretical Computer Science, 37:109-116, February 1989. Columns: Computational Geometry.

[Edelsbrunner, 1989b]

Herbert Edelsbrunner. ( Non-Obtuse Triangulations & Stabbing Triangles ). Bulletin of the European Association for Theoretical Computer Science, 38:74-78, June 1989. Columns: Computational Geometry.

[Edelsbrunner, 1990]

H. Edelsbrunner. The Computational Geometry Column. Bulletin of the European Association for Theoretical Computer Science, 42:132-134, October 1990. Columns: Computational Geometry.

[Ehrenfeucht and Rozenberg, 1983]

A. Ehrenfeucht and G. Rozenberg. A Solution to P12. Bulletin of the European Association for Theoretical Computer Science, 19:16-18, February 1983. Technical Contributions.

[Ehrenfeucht et al., 2006]

A. Ehrenfeucht, J.F. Peters, G. Rozenberg, and A. Skowron. Zdzislaw Pawlak (1926-2006). Bulletin of the European Association for Theoretical Computer Science, 90:202-204, October 2006. Obituary.

[Ehrig and Adametz, 1991]

H. Ehrig and H. Adametz. New Compatibility Results for Implementations within the Initial Algebraic Approach. Bulletin of the European Association for Theoretical Computer Science, 43:131-112, February 1991. Columns: Algebraic Specification.

[Ehrig and Arbib, 1990]

H. Ehrig and M.A. Arbib. Linking Schemas and Module Specifications: a Proposal. Bulletin of the European Association for Theoretical Computer Science, 42:136-139, October 1990. Columns: Algebraic Specification.

[Ehrig and Claßen, 1989]

Hartmut Ehrig and Ingo Claßen. Overview of Algebraic Specification Languages, Environments and Tools and Algebraic Specifications of Software Systems (Part 1). Bulletin of the European Association for Theoretical Computer Science, 39:103-111, October 1989. Columns: Algebraic Specification.

[Ehrig and Cla ssen , 1990a]

H. Ehrig and I. Cla ssen . Overview of algebraic specification languages, environments and tools, and algebraic specifications of software systems. Bulletin of the European Association for Theoretical Computer Science, 41:145-153, June 1990. Columns: Algebraic Specification.

[Ehrig and Classen, 1990b]

H. Ehrig and I. Classen. Overview of Algebraic Specification Languages Environments and Tools, and Algebraic specifications of Software Systems. Bulletin of the European Association for Theoretical Computer Science, 40:172-181, February 1990. Columns: Computational Geometry.

[Ehrig and Mahr, 1995]

Hartmut Ehrig and Bernd Mahr. Theory and Practice of Software Development: A Review of Driving Forces and Expectations. Bulletin of the European Association for Theoretical Computer Science, 57:135-144, October 1995. Columns: Algebraic Specification.

[Ehrig and Mahr, 1996]

H. Ehrig and B. Mahr. Algebraic Techniques in Software Development. Bulletin of the European Association for Theoretical Computer Science, 58:105-117, February 1996. Columns: Algebraic Specification.

[Ehrig and Mahr, 2005]

H. Ehrig and B. Mahr. TAPSOFT 2005 - Past and future. Bulletin of the European Association for Theoretical Computer Science, 86:146--, June 2005. Columns: Formal Specification.

[Ehrig and Orejas, 1994]

H. Ehrig and F. Orejas. Dynamic Abstract Data Types: An Informal Proposal. Bulletin of the European Association for Theoretical Computer Science, 53:162-169, June 1994. Columns: Algebraic Specification.

[Ehrig and Orejas, 1998]

H. Ehrig and F. Orejas. Integration Paradigm for Data Type and Process Specification Techniques. Bulletin of the European Association for Theoretical Computer Science, 65:90--, June 1998. Columns: Formal Specification.

[Ehrig and Padberg, 1994]

H. Ehrig and J. Padberg. Linking Algebraic High Level Nets and Dynamic Abstract Data. Bulletin of the European Association for Theoretical Computer Science, 54:132-144, October 1994. Columns: Algebraic Specification.

[Ehrig and Reisig, 1997]

Hartmut Ehrig and Wolfgang Reisig. An Algebraic View on Petri Nets. Bulletin of the European Association for Theoretical Computer Science, 61:52-58, February 1997. Columns: Formal Specification.

[Ehrig and Schröter, 2000]

H. Ehrig and G. Schröter. The Role of Mathematics and Formal Specification Techniques in Software System Development. Bulletin of the European Association for Theoretical Computer Science, 72:77--, October 2000. Columns: Formal Specification.

[Ehrig and Taentzer, 1996]

H. Ehrig and G. Taentzer. Computing by Graph Transformation, A Survey and Annotated Bibliography. Bulletin of the European Association for Theoretical Computer Science, 59:182-226, June 1996. Bibliographies.

[Ehrig and Wolter, 1996]

H. Ehrig and U. Wolter. The Impact and Future Role of Algebraic Specification. Bulletin of the European Association for Theoretical Computer Science, 60:74-95, October 1996. Columns: Formal Specification.

[Ehrig et al., 1980]

Hartmut Ehrig, Hans-Jörg Kreowski, and Peter Padawitz. Completeness in algebraic specifications. Bulletin of the European Association for Theoretical Computer Science, 11:2-9, June 1980. Technical Contributions.

[Ehrig et al., 1986a]

H. Ehrig, A. Habel, U. Hummert, and P. boehm. Towards algebraic data types grammars: a junction between algebraic specification and graph grammars. Bulletin of the European Association for Theoretical Computer Science, 29:22-27, June 1986. Technical Contributions.

[Ehrig et al., 1986b]

H. Ehrig, J. Loeckx, and B. Mahr. A remark on the equational calculus for many-sorted algebras with possibly empty carrier sets. Bulletin of the European Association for Theoretical Computer Science, 30:61-66, October 1986. Technical Contributions.

[Ehrig et al., 1991]

H. Ehrig, M. Baldamus, and F. Orejas. Amalgamation and Extension in the Framework of Specification Logics and Generalized Morphisms. Bulletin of the European Association for Theoretical Computer Science, 44:129-143, June 1991. Columns: Algebraic Specification.

[Ehrig et al., 1995]

H. Ehrig, H.-J. Kreowski, and F. Orejas. Correctness of actualization for parameterized implementation concepts based on constructors and abstractors. Bulletin of the European Association for Theoretical Computer Science, 56, June 1995. Columns: Algebraic Specification.

[Ehrig et al., 1997]

H. Ehrig, A. Merten, and J. Padberg. How to Transfer Concepts of Abstract Data Types to Petri Nets? Bulletin of the European Association for Theoretical Computer Science, 62:106-114, June 1997. Columns: Formal Specification.

[Ehrig et al., 1999]

H. Ehrig, J. Padberg, and F. Orejas. From Basic Views and Aspects to Integration of Specification Formalisms. Bulletin of the European Association for Theoretical Computer Science, 69:98-108, October 1999. Columns: Formal Specification Column.

[Ehrig et al., 2000]

H. Ehrig, R. Geisler, M. Große-Rhode, M. Klar, and S. Mann. On Formal Semantics and Integration of Object-Oriented Modeling Languages. Bulletin of the European Association for Theoretical Computer Science, 70:77-81, February 2000. Columns: Formal Specification.

[Ehrig et al., 2007]

H. Ehrig, K. Ehrig, C. Ermel, and U. Prange. Model transformations by graph transformations are functors. Bulletin of the European Association for Theoretical Computer Science, 93:134--, October 2007. Columns: Formal Specification.

[Ehrig et al., 2009a]

H. Ehrig, C. Ermel, F. Hermann, and B. König. Behaviour Simulation and Equivalence of Systems Modelled by Graph Transformation. Bulletin of the European Association for Theoretical Computer Science, 97:117--, February 2009.

[Ehrig et al., 2009b]

H. Ehrig, F. Hermann, and U. Prange. Cospan DPO Approach: An Alternative for DPO Graph Transformations. Bulletin of the European Association for Theoretical Computer Science, 98:139--, June 2009. Columns: Formal Specification.

[Ehrig, 1979]

Hartmut Ehrig. Graph Grammars versus Discrete Dynamics. Bulletin of the European Association for Theoretical Computer Science, 9:14-15, October 1979. Technical Contributions.

[Ehrig, 1981]

H.-D. Ehrig. Implicit specification by algebraic domain equations. Bulletin of the European Association for Theoretical Computer Science, 13:45-51, February 1981. Technical Contributions.

[Ehrig, 1982]

H. Ehrig. Applications of conditional graph productions to consistency, synchronization and scheduling in data base systems. Bulletin of the European Association for Theoretical Computer Science, 16:24-30, February 1982. Technical Contributions.

[Ehrig, 1987a]

Hartmut Ehrig. ( Scheme for Algebraic Specification Topics ). Bulletin of the European Association for Theoretical Computer Science, 32:70-72, June 1987. Columns: Algebraic Specification.

[Ehrig, 1987b]

Hartmut Ehrig. ( Workshop on Specification of Abstract Data Types ). Bulletin of the European Association for Theoretical Computer Science, 33:25-26, October 1987. Columns: Algebraic Specification.

[Ehrig, 1988a]

Hartmut Ehrig. The Algebraic Specification Column, 3. Bulletin of the European Association for Theoretical Computer Science, 34:39-40, February 1988. Columns: Algebraic Specification.

[Ehrig, 1988b]

Hartmut Ehrig. On the Potential Role of Algebraic Specification within Computer Science. Bulletin of the European Association for Theoretical Computer Science, 35:69-71, June 1988. Columns: Algebraic Specification.

[Ehrig, 1988c]

Hartmut Ehrig. Questionnaire for Information about Applications of Algebraic Specifications. Bulletin of the European Association for Theoretical Computer Science, 36:52-56, October 1988. Columns: Algebraic Specification.

[Ehrig, 1989]

Hartmut Ehrig. ( Concepts for Transformations and Implementations of Specifications ). Bulletin of the European Association for Theoretical Computer Science, 38:79-92, June 1989. Columns: Algebraic Specification.

[Ehrig, 1990]

H. Ehrig. ESF-concepts linked with algebraic module specifications. Bulletin of the European Association for Theoretical Computer Science, 41:138-144, June 1990. Columns: Algebraic Specification.

[Ehrig, 1992]

H. Ehrig. Some important new facts supporting the development of algebraic specifications. Bulletin of the European Association for Theoretical Computer Science, 47:135-137, June 1992. Columns: Algebraic Specification.

[Ehrig, 1994]

H. Ehrig. FLEX: A Flexible Extension and Integration Concept for Software Developments in KORSO and COMPASS. Bulletin of the European Association for Theoretical Computer Science, 52:189-202, February 1994. Columns: Algebraic Specification.

[Ehrig, 2000]

H. Ehrig. On the Role of Formal Specification Techniques: From TAPSOFT 1985 to ETAPS 2000. Bulletin of the European Association for Theoretical Computer Science, 71:90--, June 2000. Columns: Formal Specification.

[Ehrig, 2001a]

H. Ehrig. On the Roots, Birth and Childhood of ETAPS. Bulletin of the European Association for Theoretical Computer Science, 74:58--, June 2001. Columns: Formal Specification.

[Ehrig, 2001b]

H. Ehrig. A Review of Graph Grammars and Preview of ICGT 2002: The First International Conference on Graph Transformation. Bulletin of the European Association for Theoretical Computer Science, 75:93--, October 2001. Columns: Formal Specification Column.

[Ehrig, 2002a]

H. Ehrig. Bigraphs meet Double Pushouts. Bulletin of the European Association for Theoretical Computer Science, 78:72--, October 2002. Columns: Formal Specification.

[Ehrig, 2002b]

H. Ehrig. A Review of Algebraic Specification and Component Techniques at TU Berlin. Bulletin of the European Association for Theoretical Computer Science, 76:84-87, February 2002. Columns: Formal Specification.

[Ehrig, 2003]

H. Ehrig. The Formal Specification Column On the relevance of high-level net processes. Bulletin of the European Association for Theoretical Computer Science, 79:64--, February 2003. Columns: Formal Specification.

[Ehrig, 2004a]

H. Ehrig. Attributed Graphs and Typing: Reationshi between Different Representations. Bulletin of the European Association for Theoretical Computer Science, 82:175-190, February 2004. Columns: Formal Specification.

[Ehrig, 2004b]

H. Ehrig. Integration of Specification Techniques for Applications in Engineering 1998-2004. Bulletin of the European Association for Theoretical Computer Science, 83:156-158, June 2004. Columns: Formal Specification.

[Ehrig, 2006a]

H. Ehrig. Footprints of HR in initial algebra and final coalgebra. Bulletin of the European Association for Theoretical Computer Science, 88:120-125, February 2006. Columns: Formal Specification.

[Ehrig, 2006b]

H. Ehrig. Report on ACCAT Workshop at ETAPS 2006. Bulletin of the European Association for Theoretical Computer Science, 89:134, June 2006. Columns: Formal Specification.

[Ehrig, 2006c]

H. Ehrig. Review of Dines Bjørner's textbooks Software Engineering 1-3. Bulletin of the European Association for Theoretical Computer Science, 90:131-133, October 2006. Columns: Formal Specification.

[Eisman, 1980]

Gerald S. Eisman. Intercalation theorems for derivation controlled Lindenmeyer systems. Bulletin of the European Association for Theoretical Computer Science, 11:20-22, June 1980. Technical Contributions.

[Engelfriet, 1985]

Joost Engelfriet. The non-computability of computability. Bulletin of the European Association for Theoretical Computer Science, 26:36-39, June 1985. Technical Contributions.

[Engelfriet, 1996]

Joost Engelfriet. Reverse Twin Shuffles. Bulletin of the European Association for Theoretical Computer Science, 60:144, October 1996. Technical Contributions.

[Englert, 2007]

B. Englert. OPODIS 2006 report. Bulletin of the European Association for Theoretical Computer Science, 91:76, February 2007. Columns: Distributed Computing.

[English et al., 1993]

S. English, R. Bosworth, and D. Simpson. Concurrency Clichés in CCS and CPN. Bulletin of the European Association for Theoretical Computer Science, 49:202-204, February 1993. Educational Matters.

[Erb et al., 1997]

Ulrike Erb, Hans-Jörg Kreowski, Veronika Oechtering, and Ingrid Rügge. Informatica Feminale: Summer University for Women in Computer Science. Bulletin of the European Association for Theoretical Computer Science, 61:93-99, February 1997. Educational Matters.

[Erhig and Prange, 2008]

H. Erhig and U. Prange. Flattening of generalized algebraic high-level nets. Bulletin of the European Association for Theoretical Computer Science, 94:151--, February 2008. Columns: Formal Specification.

[Ermel, 2009]

C. Ermel. Visual Modelling and Analysis of Model Transformations based on Graph Transformation. Bulletin of the European Association for Theoretical Computer Science, 99:135--, October 2009. Columns: Formal Specification.

[Erni and Geibel, 1985]

W. Erni and R. Geibel. Recognition of E0L by polynomial Boolean circuits. Bulletin of the European Association for Theoretical Computer Science, 26:40-43, June 1985. Technical Contributions.

[Esparza and Nielsen, 1994]

J. Esparza and M. Nielsen. Decidability Issues for Petri Nets - a Survey. Bulletin of the European Association for Theoretical Computer Science, 52:245-262, February 1994. Columns: Concurrency.

[Esparza et al., 2000]

J. Esparza, P. Rossmanith, and S. Schwoon. A Uniform Framework for Problems on Context-Free Grammars. Bulletin of the European Association for Theoretical Computer Science, 72:169--, October 2000. Technical Contributions.

[Even and Yacobi, 1981]

Shimon Even and Yacov Yacobi. A 'hard-core' theorem for randomized algorithms. Bulletin of the European Association for Theoretical Computer Science, 13:30-36, February 1981. Technical Contributions.

[Fachini and Iania, 1986]

E. Fachini and L. Iania. A note on the paper 'Systolic tree acceptoors' by K. Culik II, A. Salomaa and D. Wood. Bulletin of the European Association for Theoretical Computer Science, 28:26-30, February 1986. Technical Contributions.

[Feigenbaum and Shenker, 2003]

J. Feigenbaum and S. Shenker. Distributed algorithmic mechanism design: recent results and future directions. Bulletin of the European Association for Theoretical Computer Science, 79:101--, February 2003. Columns: Distributed Computing.

[Feldmann et al., 2003]

R. Feldmann, M. Gairing, T. Lücking, B. Monien, and M. rode. Selfish Routing in Non-Cooperative Networks: A Survey. Bulletin of the European Association for Theoretical Computer Science, 81:137-164, October 2003. Columns: Distributed Computing.

[Fenner, 2003]

S.A. Fenner. A physics-free introduction to the quantum computation model. Bulletin of the European Association for Theoretical Computer Science, 79:69-85, February 2003. Columns: Computational Complexity.

[Ferbus-Zanda and Grigorieff, 2001]

M. Ferbus-Zanda and S. Grigorieff. Is Randomness ``Native'' to Computer Science? Bulletin of the European Association for Theoretical Computer Science, 74:78--, June 2001. Columns: Logic in Computer Science.

[Fernau, 1995]

H. Fernau. A predicate for separating language classes. Bulletin of the European Association for Theoretical Computer Science, 56, June 1995. Technical Contributions.

[Fernau, 1996]

H. Fernau. Closure Properties of Ordered Languages. Bulletin of the European Association for Theoretical Computer Science, 58:159-162, February 1996. Technical Contributions.

[Fernau, 2003]

H. Fernau. Education(al) matters: teaching P versus NP. Bulletin of the European Association for Theoretical Computer Science, 80:237--, June 2003. Education Matters.

[Fett et al., 1993]

A. Fett, C. Gerke, W. Grieskamp, and P. Pepper. Algebraic Programming in OPAL. Bulletin of the European Association for Theoretical Computer Science, 50:171-181, June 1993. Columns: Algebraic Specification.

[Fiduccia, 1979]

C. M. Fiduccia. Remarks on a Note of Alt and van Leeuwen Regarding Products in Finite-dimensional Algebras. Bulletin of the European Association for Theoretical Computer Science, 9:32-33, October 1979. Technical Contributions.

[Finkel, 1984]

A. Finkel. Petri nets and homogenous FIFO nets. Bulletin of the European Association for Theoretical Computer Science, 23:28-31, June 1984. Technical Contributions.

[Finkel, 2005]

Olivier Finkel. On Decision Problems for Timed Automata. Bulletin of the European Association for Theoretical Computer Science, 87:185-190, October 2005. Technical Contributions.

[Finkel, 2006]

O. Finkel. On the shuffle of regular timed languages. Bulletin of the European Association for Theoretical Computer Science, 88:182-184, February 2006. Technical Contributions.

[Fiore et al., 1996]

Marcelo Fiore, Achim Jung, Eugenio Moggi, Peter O'Hearn, Jon Riecke, Giuseppe Rosolini, and Ian Stark. Domains and Denotational Semantics: History, Accomplishments and Open Problems. Bulletin of the European Association for Theoretical Computer Science, 59:227-256, June 1996. Surveys and Tutorials.

[Fischer and van Leeuwen, 1980]

M.J. Fischer and J. van Leeuwen. Reducing 3DM to Clique and Hamiltonian Circuit. Bulletin of the European Association for Theoretical Computer Science, 11:15-19, June 1980. Technical Contributions.

[Fischer and Wehrheim, 2000]

C. Fischer and H. Wehrheim. Failure-Divergence Semantics as a Formal Basis for an Object-Oriented Integrated Formal Method. Bulletin of the European Association for Theoretical Computer Science, 71:92--, June 2000. Columns: Formal Specification.

[Fischer, 2001]

E. Fischer. The Art of Uninformed Decisions. Bulletin of the European Association for Theoretical Computer Science, 75:97--, October 2001. Columns: Computational Complexity.

[Fisenbrand, 2008]

F. Fisenbrand. Algorithmics for integer programming. Bulletin of the European Association for Theoretical Computer Science, 96:45--, October 2008. Columns: Algorithmics.

[Fitting, 1996]

M. Fitting. A Program to Compute Gödel-Löb Fixpoints. Bulletin of the European Association for Theoretical Computer Science, 58:118-130, February 1996. Columns: Logic in Computer Science.

[Floréen, 1993]

P. Floréen. A short introduction to neural associative memories. Bulletin of the European Association for Theoretical Computer Science, 51:236-245, October 1993. Surveys and Tutorials.

[Flum and Grohe, 2004]

J. Flum and M. Grohe. Parametrized Complexity and Subexponential Time. Bulletin of the European Association for Theoretical Computer Science, 84:71-100, October 2004. Columns: Computational Complexity.

[Flum, 2001]

J. Flum. Tree-Decompositions and the Model-Checking Problem. Bulletin of the European Association for Theoretical Computer Science, 73:78--, February 2001. Columns: Logic in Computer Science.

[Fogel and Michalewicz, 1999]

D.B. Fogel and Z. Michalewicz. Why Evolutionary Algorithms. Bulletin of the European Association for Theoretical Computer Science, 68:115--, June 1999. Columns: Natural Computing.

[Fokkink et al., 2004]

W. Fokkink, J.F. Groote, and M. Reners. Process Algebra Needs Proof Methodology. Bulletin of the European Association for Theoretical Computer Science, 82:109-125, February 2004. Columns: Concurrency.

[Fomin et al., 2005]

Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch. Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Bulletin of the European Association for Theoretical Computer Science, 87:47-77, October 2005. Columns: Algorithmics.

[Formann and Wöginger, 1990]

M. Formann and G. Wöginger. On the reconstruction of simple polygons. Bulletin of the European Association for Theoretical Computer Science, 40:225-230, February 1990. Technical Contributions.

[Fortnow and Homer, 2003]

L. Fortnow and S. Homer. A Short History of Computational Complexity. Bulletin of the European Association for Theoretical Computer Science, 80:95--, June 2003. Columns: Computational Complexity.

[Fortnow, 1994]

L. Fortnow. The Role of Relativization in Complexity Theory. Bulletin of the European Association for Theoretical Computer Science, 52:229-244, February 1994. Columns: Structural Complexity.

[Fortnow, 2000]

L. Fortnow. Diagonalization. Bulletin of the European Association for Theoretical Computer Science, 71:102--, June 2000. Columns: Computational Complexity.

[Fotakis et al., 2001]

D.A. Fotakis, S.E. Nikoletseas, V.G. Papadopoulou, and P.G. Spirakis. Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem. Bulletin of the European Association for Theoretical Computer Science, 75:152--, October 2001. Columns: Distributed Computing.

[Franch et al., 1999]

X. Franch, J. Gabarró, A. Gómez, A. Vázquez, and J. Vázquez. An Introductory Programming Pilot Course Using Java. Bulletin of the European Association for Theoretical Computer Science, 69:152-154, October 1999. Educational Matters.

[Freivalds and Kinber, 1983]

R. Freivalds and E. B. Kinber. On Extension of Inferrable Classes. Bulletin of the European Association for Theoretical Computer Science, 20:49-53, June 1983. Technical Contributions.

[Freivalds et al., 1993]

R. Freivalds, E. Kinber, and C.H. Smith. On the impact of forgetting on learning machines. Bulletin of the European Association for Theoretical Computer Science, 51:212-225, October 1993. Technical Contributions.

[freivalds, 1984]

R. freivalds. An answer to an open problem. Bulletin of the European Association for Theoretical Computer Science, 23:31-32, June 1984. Technical Contributions.

[Freivalds, 1985]

R. Freivalds. Recursiveness of the enumerating functions increases the inferrability of recursively enumerable sets. Bulletin of the European Association for Theoretical Computer Science, 27:35-40, October 1985. Technical Contributions.

[Freund and Oswald, 2002]

R. Freund and M. Oswald. A Short Note on Analysing P Systems with Antiport Rules. Bulletin of the European Association for Theoretical Computer Science, 78:231--, October 2002. Technical Contributions.

[Freund and Paun, 1994]

R. Freund and G. Paun. The shape of a language: some open problems. Bulletin of the European Association for Theoretical Computer Science, 54:378-380, October 1994. Problems and Solutions.

[Freund, 2001]

R. Freund. Special Variants of P Systems Inducing an Infinite Hierarchy with Respect to the Number of Membranes. Bulletin of the European Association for Theoretical Computer Science, 75:209--, October 2001. Technical Contributions.

[Fülöp and Vágvölgyi, 1988]

Z. Fülöp and S. Vágvölgyi. Note. On the Domain of Tree Transducers. Bulletin of the European Association for Theoretical Computer Science, 34:55-61, February 1988. Technical Contributions.

[Fülöp and Vágvölgyi, 1989]

Z. Fülöp and S. Vágvölgyi. Congruential Tree Languages are the Same as Recognizable Tree Languages -- A Proof for a Theorem of D. Kozen. Bulletin of the European Association for Theoretical Computer Science, 39:175-185, October 1989. Technical Contributions.

[Fülöp and Vágvölgyi, 1991]

Z. Fülöp and S. Vágvölgyi. Ground Term Rewriting Rules for the Word Problem of Ground Term Equations. Bulletin of the European Association for Theoretical Computer Science, 45:186-201, October 1991. Technical Contributions.

[Furia and Rossi, 2007]

C.A. Furia and M. Rossi. No need to be strict: On the expressiveness of metric temporal logics with (non-)strict operators. Bulletin of the European Association for Theoretical Computer Science, 92:150-160, June 2007. Technical Contributions.

[Futatsugi et al., 2006]

K. Futatsugi, J.-P. Jouannaud, and J. Meseguer. Joseph Goguen (1941-2006). Bulletin of the European Association for Theoretical Computer Science, 90:199-201, October 2006. Obituary.

[Gabarró, 1985]

J. Gabarró. Some applications of the interchange lemma 19-21. Bulletin of the European Association for Theoretical Computer Science, 25, February 1985. Technical Contributions.

[Gabow, 1983]

Harold M. Gabow. Priming the Pump for Lower Bounds on Chomsky Form. Bulletin of the European Association for Theoretical Computer Science, 20:54-67, June 1983. Technical Contributions.

[Gaifman and Vardi, 1985]

Haim Gaifman and Moshi Y. Vardi. A simple proof that connectivity of finite graphs is not first-order definable. Bulletin of the European Association for Theoretical Computer Science, 26:43-45, June 1985. Technical Contributions.

[Gal-Ezer et al., 1996]

Judith Gal-Ezer, Catriel Beeri, David Harel, and Amiram Yehudai. A High-School Program in Computer Science. Bulletin of the European Association for Theoretical Computer Science, 60:165-185, October 1996. Educational Matters.

[Galil, 1992]

Z. Galil. Obituary Renato Capocelli. Bulletin of the European Association for Theoretical Computer Science, 47:427, June 1992. Obituaries.

[Galley, 1995]

C.N. Galley. An Omega(log n) time linear cost lower bound forthe single function coarsest partition problem. Bulletin of the European Association for Theoretical Computer Science, 56, June 1995. Technical Contributions.

[Gallier and Snyder, 1990]

J.H. Gallier and W. Snyder. Designing unification procedures. Bulletin of the European Association for Theoretical Computer Science, 40:273-326, February 1990. Surveys and Tutorials.

[Gambosi et al., 1990]

G. Gambosi, A. Postiglione, and M. Talamo. On the average performance of some algorithms for on-line bin-packing. Bulletin of the European Association for Theoretical Computer Science, 41:202-209, June 1990. Technical Contributions.

[Ganzinger and Giegerich, 1987]

Harald Ganzinger and Robert Giegerich. A note on termination in combinations of heterogeneous term rewriting systems. Bulletin of the European Association for Theoretical Computer Science, 31:22-28, February 1987. Technical Contributions.

[García and de Parga, 2005]

Pedro García and Manuel Vázquez de Parga. A note about mergible states in large NFA. Bulletin of the European Association for Theoretical Computer Science, 87:181-184, October 2005. Technical Contributions.

[García and Ruiz, 2004]

P. García and J. Ruiz. A Note on Minimal Cover-Automata for Finite Languages. Bulletin of the European Association for Theoretical Computer Science, 83:193-199, June 2004. Technical Contributions.

[Garzon, 2003]

M. Garzon. Biomolecular computing in silico. Bulletin of the European Association for Theoretical Computer Science, 79:129--, February 2003. Columns: Natural Computing.

[Gasarch et al., 2000]

W. Gasarch, E. Golub, and C. Kruskal. A Survey of Constant Time Parallel Sorting. Bulletin of the European Association for Theoretical Computer Science, 72:84--, October 2000. Columns: Computational Complexity.

[Gasarch, 2004]

W. Gasarch. A Survey on Private Information Retrieval. Bulletin of the European Association for Theoretical Computer Science, 82:72-107, February 2004. Columns: Computational Complexity.

[Gates and Kreinovich, 2001]

A.Q. Gates and V. Kreinovich. Strassen's Algorithm Made (Somewhat) More Natural: A Pedagogical Remark. Bulletin of the European Association for Theoretical Computer Science, 73:142--, February 2001. Technical Contributions.

[Gates et al., 1998]

A.Q. Gates, V. Kreinovich, and L. Longpré. Kolmogorov Complexity Justifies Software Engineering Heuristics. Bulletin of the European Association for Theoretical Computer Science, 66:150-154, October 1998. Technical Contributions.

[Gatto et al., 2004]

M. Gatto, R. Jacob, L. Peeters, B. Weber, and P. Widmayer. Theory on the Tracks: A Selection of Railway Optimization Problems. Bulletin of the European Association for Theoretical Computer Science, 84:41-70, October 2004. Columns: Algorithmics.

[Gay, 2005]

S. Gay. Quantum programming languages - Survey and bibliography. Bulletin of the European Association for Theoretical Computer Science, 86:176--, June 2005. Columns: Programming Languages.

[Gécseg, 1986]

F. Gécseg. The role of theory in computer science. Bulletin of the European Association for Theoretical Computer Science, 30:295-298, October 1986. Miscellaneous.

[Georgieva, 1983]

Nadejda Georgieva. Notes on the Equivalence of Some Programs. Bulletin of the European Association for Theoretical Computer Science, 21:24-30, October 1983. Technical Contributions.

[Gernert and Sammer, 1980]

Dieter Gernert and Gerhard Sammer. Procedure call by pattern matching. Bulletin of the European Association for Theoretical Computer Science, 12:66-75, October 1980. Technical Contributions.

[Gernert, 1979a]

Dieter Gernert. Homogeneous Graph Grammars. Bulletin of the European Association for Theoretical Computer Science, 9:25-31, October 1979. Technical Contributions.

[Gernert, 1979b]

Dieter Gernert. Measuring the Similarity of Complex Structures by Means of Graph Grammars. Bulletin of the European Association for Theoretical Computer Science, 7:3-9, February 1979. Technical Contributions.

[Gernert, 1979c]

Dieter Gernert. Representation of knowledge by means of nonprocedural languages and their compilers. Bulletin of the European Association for Theoretical Computer Science, 8:18-24, June 1979. Technical Contributions.

[Gernert, 1980]

Dieter Gernert. New results on odd perfect numbers (preliminary announcement). Bulletin of the European Association for Theoretical Computer Science, 10:60-61, January 1980. Technical Contributions.

[Gernert, 1981]

Dieter Gernert. Graph grammars which generate graphs with specified properties. Bulletin of the European Association for Theoretical Computer Science, 13:13-20, February 1981. Technical Contributions.

[Geser, 1998]

A. Geser. On Essential Premises for the Transformation Order. Bulletin of the European Association for Theoretical Computer Science, 65:139--, June 1998. Technical Contributions.

[Geurts, 1995]

Frédéric Geurts. Hierarchy of Discrete-Time Dynamical Systems, a Survey. Bulletin of the European Association for Theoretical Computer Science, 57:230-251, October 1995. Surveys and Tutorials.

[Gheorge and Paun, 1986]

M. Gheorge and Gh. Paun. Two (infinite?) hierarchies of vector languages. Bulletin of the European Association for Theoretical Computer Science, 29:27-31, June 1986. Technical Contributions.

[Gheorge, 1985]

Marian Gheorge. Descriptional complexity measures suggested by Hartmann's recovery scheme. Bulletin of the European Association for Theoretical Computer Science, 26:45-54, June 1985. Technical Contributions.

[Giegerich and Ohlebusch, 1991]

R. Giegerich and E. Ohlebusch. An Implicit Representation of Infinite Sequences of Terms. Bulletin of the European Association for Theoretical Computer Science, 43:173-182, February 1991. Technical Contributions.

[Gnaedig, 1987]

I. Gnaedig. Knuth-Bendix procedure and non deterministic behavior -- An example. Bulletin of the European Association for Theoretical Computer Science, 32:86-92, June 1987. Technical Contributions.

[Gogolla and Ehrich, 1983]

M. Gogolla and H. D. Ehrich. Algebraic Specification with Subsorts using Declarations. Bulletin of the European Association for Theoretical Computer Science, 21:31-38, October 1983. Technical Contributions.

[Gogolla, 1990]

M. Gogolla. A note on the translation of SQL tuple calculus. Bulletin of the European Association for Theoretical Computer Science, 40:231-236, February 1990. Technical Contributions.

[Goguen and Diaconescu, 1992]

J. Goguen and R. Diaconescu. A short Oxford survey of order sorted algebra. Bulletin of the European Association for Theoretical Computer Science, 48:121-133, October 1992. Columns: Algebraic Specification.

[Goguen and Meseguer, 1986]

J.A. Goguen and J. Meseguer. Remarks on remarks on many-sorted equational logic. Bulletin of the European Association for Theoretical Computer Science, 30:66-73, October 1986. Technical Contributions.

[Goguen, 1989]

Josesph A. Goguen. Memories of ADJ. Bulletin of the European Association for Theoretical Computer Science, 39:97-102, October 1989. Columns: Algebraic Specification.

[Golubski and Lippe, 1989]

Wolfgang Golubski and Wolfram-M. Lippe. Extensions of Top-Down Tree-to-String Transductions. Bulletin of the European Association for Theoretical Computer Science, 38:164-168, June 1989. Technical Contributions.

[Goodman and Pollack, 1985]

Jacob E. Goodman and Richard Pollack. On problem P74 - 'How many planar configurations are there?'. Bulletin of the European Association for Theoretical Computer Science, 26:242, June 1985. Problems and Solutions.

[Grädel, 1999]

E. Grädel. Why are Modal Logics so Robustly Decidable?. Bulletin of the European Association for Theoretical Computer Science, 68:90-103, June 1999. Columns: Logic in Computer Science.

[Gramlich, 1994]

B. Gramlich. A Note on a Parameterized Version of the Well-Founded Induction Principle. Bulletin of the European Association for Theoretical Computer Science, 52:274-278, February 1994. Technical Contributions.

[Grigore, 1994]

R. Grigore. The Institution of Order-Sorted Equational Logic. Bulletin of the European Association for Theoretical Computer Science, 53:250-255, June 1994. Technical Contributions.

[Groenewegen, 1982]

Luuk P.J. Groenewegen. Decision Proceses and Parallel Programs. Bulletin of the European Association for Theoretical Computer Science, 17:18-33, June 1982. Technical Contributions.

[Gröger and Turán, 1993]

H.D. Gröger and Gy. Turán. A linear lower bound for the size of threshold circuits. Bulletin of the European Association for Theoretical Computer Science, 50:220-222, June 1993. Technical Contributions.

[Groote, 1994]

J.F. Groote. An optimisation problem for an AC operator. Bulletin of the European Association for Theoretical Computer Science, 54:380-382, October 1994. Problems and Solutions.

[Große-Rhode, 1992]

M. Große-Rhode. Restriction Constructions in Specification Logics. Bulletin of the European Association for Theoretical Computer Science, 46:84-89, February 1992. Columns: Algebraic Specification.

[Große-Rhode, 1995]

M. Große-Rhode. Transition Specifications for Dynamic Abstract Data Types. Bulletin of the European Association for Theoretical Computer Science, 55:121-128, February 1995. Columns: Algebraic Specification.

[Grosse-Rhode, 1999]

M. Grosse-Rhode. On a Reference Model for the Formalization and Integration of Software Specification Languages. Bulletin of the European Association for Theoretical Computer Science, 68:81--, June 1999. Columns: Formal Specification.

[Große-Rhode, 2001]

M. Große-Rhode. The DFG Priority Programme ``Integration of Software Specification Techniques for Applications in Engineering''. Bulletin of the European Association for Theoretical Computer Science, 73:52--, February 2001. Columns: Formal Specification.

[Gruska, 1981]

J. Gruska. Ten years of MFCS. Bulletin of the European Association for Theoretical Computer Science, 15:21-31, October 1981. Special Features Technical Contributions.

[Guerraoui and Kapaka, 2009]

R. Guerraoui and M. Kapaka. The Theory of Transactional Memory. Bulletin of the European Association for Theoretical Computer Science, 97:83--, February 2009. Columns: Distributed Computing.

[Guessarian, 1986]

I. Guessarian. Fixpoint techniques in data base recursive logic prorams. Bulletin of the European Association for Theoretical Computer Science, 29:32-35, June 1986. Technical Contributions.

[Guessarian, 1988]

Irène Guessarian. Fixpoint Strategies for Deductive Datebases. Bulletin of the European Association for Theoretical Computer Science, 35:128-136, June 1988. Technical Contributions.

[Guibas and Hershberger, 1985]

Leo Guibas and John Hershberger. Computing the visibility graph of n line segments in O(n^2) time. Bulletin of the European Association for Theoretical Computer Science, 26:13-20, June 1985. Technical Contributions.

[Gunawardena, 1994]

J. Gunawardena. Homotopy and Concurrency. Bulletin of the European Association for Theoretical Computer Science, 54:184-193, October 1994. Columns: Concurrency.

[Gunter, 1991]

C.A. Gunter. Forms of Semantic Specification. Bulletin of the European Association for Theoretical Computer Science, 45:98-113, October 1991. Columns: Logic in Computer Science.

[Gurevich and Neeman, 2009]

Y. Gurevich and I. Neeman. The Logics of Infons. Bulletin of the European Association for Theoretical Computer Science, 98:150--, June 2009. Columns: Logics in Computer Science.

[Gurevich, 1988]

Yuri Gurevich. Kolmogorov Machines and related issues. Bulletin of the European Association for Theoretical Computer Science, 35:71-82, June 1988. Columns: Logic in Computer Science.

[Gurevich, 1989a]

Yuri Gurevich. The Challenger-Solver Game: Variations on the Theme of P =? NP. Bulletin of the European Association for Theoretical Computer Science, 39:112-121, October 1989. Columns: Logic in Computer Science.

[Gurevich, 1989b]

Yuri Gurevich. Infinite Games. Bulletin of the European Association for Theoretical Computer Science, 38:93-100, June 1989. Columns: Logic in Computer Science.

[Gurevich, 1990]

Y. Gurevich. On the Classical Decision Problem. Bulletin of the European Association for Theoretical Computer Science, 42:140-150, October 1990. Columns: Logic in Computer Science.

[Gurevich, 1991]

Y. Gurevich. Evolving Algebras, A Tutorial Introduction. Bulletin of the European Association for Theoretical Computer Science, 43:264-284, February 1991. Surveys and Tutorials.

[Gurevich, 1992]

Y. Gurevich. Zero-One Laws. Bulletin of the European Association for Theoretical Computer Science, 46:90-106, February 1992. Columns: Logic in Computer Science.

[Gurevich, 1995a]

Y. Gurevich. The Value, if any, of Decidability. Bulletin of the European Association for Theoretical Computer Science, 55:129-135, February 1995. Columns: Logic in Computer Science.

[Gurevich, 1995b]

Yuri Gurevich. Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand. Bulletin of the European Association for Theoretical Computer Science, 57:145-166, October 1995. Columns: Logic in Computer Science.

[Gurevich, 1997]

Yuri Gurevich. From Invariants to Canonization. Bulletin of the European Association for Theoretical Computer Science, 63:115-119, October 1997. Columns: Logic in Computer Science.

[Gurevich, 1999]

Y. Gurevich. The Sequential ASM Thesis. Bulletin of the European Association for Theoretical Computer Science, 67:93-124, February 1999. Columns: Logic in Computer Science.

[Guruswami, 2006]

V. Guruswami. Iterative Decoding of Low-Density Parity Check Codes. Bulletin of the European Association for Theoretical Computer Science, 90:53-88, October 2006. Columns: Complexity.

[Guttman, 2004]

J.D. Guttman. A New Column: Information Security. Bulletin of the European Association for Theoretical Computer Science, 82:242-252, February 2004. Columns: Security.

[Gvozdjak, 1993]

P. Gvozdjak. One Letter Context-Free Languages Revisited. Bulletin of the European Association for Theoretical Computer Science, 49:159-162, February 1993. Technical Contributions.

[Habel et al., 1987]

Annegret Habel, Hans-Jörg Kreowski, and Walter Vogler. Compatible Graph Properties are Decidable for Hyperedge Replacement Graph Languages. Bulletin of the European Association for Theoretical Computer Science, 33:55-62, October 1987. Technical Contributions.

[Hagauer, 1978]

J. Hagauer. A simple variable-free CF grammar generating a non regular language. Bulletin of the European Association for Theoretical Computer Science, 6:28-33, October 1978. Technical Contributions.

[Hájek, 1981]

Petr Hájek. Arithmetical interpretations of dynamic logic (abstract). Bulletin of the European Association for Theoretical Computer Science, 14:16-17, June 1981. Technical Contributions.

[Halava and Harju, 2001]

V. Halava and T. Harju. Some New Results on Post Correspondence Problem and Its Modifications. Bulletin of the European Association for Theoretical Computer Science, 73:131--, February 2001. Columns: Formal Language Theory Column.

[Halava et al., 2005]

V. Halava, T. Harju, and M. Latteux. Representation of regular languages by equality sets. Bulletin of the European Association for Theoretical Computer Science, 86:224--, June 2005. Technical Contributions.

[Hamzo and Kreinovich, 1999]

C. Hamzo and V. Kreinovich. On Average Bit Complexity of Interval Arithmetic. Bulletin of the European Association for Theoretical Computer Science, 68:153--, June 1999. Technical Contributions.

[Han, 2007]

Y.-S. Han. Decision algorithms for subfamilies of regular languages using state-pair graphs. Bulletin of the European Association for Theoretical Computer Science, 93:118--, October 2007. Columns: Formal Language Theory.

[Hansel, 1986]

G. Hansel. Symbolic dynamics, automata and coding theory. Bulletin of the European Association for Theoretical Computer Science, 30:15-23, October 1986.

[Harel, 2003]

D. Harel. A Grand Challenge for Computing: towards Full Reactive Modeling of a Muli-Cellular Animal. Bulletin of the European Association for Theoretical Computer Science, 81:226-235, October 2003. Columns: Natural Computing.

[Harju and Kleijn, 1993]

T. Harju and H.C.M. Kleijn. Morphisms and rational transducers. Bulletin of the European Association for Theoretical Computer Science, 51:168-180, October 1993. Columns: Formal Language Theory.

[Harju and Nowotka, 2003]

T. Harju and D. Nowotka. Periodicity and Unbordered Segments of Words. Bulletin of the European Association for Theoretical Computer Science, 80:162--, June 2003. Technical Contributions.

[Harju and Nowotka, 2006]

T. Harju and D. Nowotka. Binary Words with Few Squares. Bulletin of the European Association for Theoretical Computer Science, 89:164, June 2006. Technical Contributions.

[Harju et al., 2003]

T. Harju, I. Petre, and G. Rozenberg. Gene Assembly in Celiates. Part I. Molecular Operations. Bulletin of the European Association for Theoretical Computer Science, 81:236-249, October 2003. Columns: Natural Computing.

[Harju et al., 2004]

T. Harju, I. Petre, and G. Rozenberg. Gene Assembly in Celiates. Part I. Molecular Operations. Bulletin of the European Association for Theoretical Computer Science, 82:227-241, February 2004. Columns: Natural Computing.

[Harju, 1982]

Tero Harju. A Note on Infinite Words Obtained by Iterating Morphisms. Bulletin of the European Association for Theoretical Computer Science, 18:12-16, October 1982. Technical Contributions.

[Harju, 1983]

Tero Harju. On Repetition Free Morphisms. Bulletin of the European Association for Theoretical Computer Science, 19:18-20, February 1983. Technical Contributions.

[Harju, 1984a]

Tero Harju. On factorizations of words. Bulletin of the European Association for Theoretical Computer Science, 24:217, October 1984. Problems and Solutions.

[Harju, 1984b]

Tero Harju. P67: A solution to a problem of Karhumäki. Bulletin of the European Association for Theoretical Computer Science, 24:218-220, October 1984. Problems and Solutions.

[Hartmanis et al., 1988]

Juris Hartmanis, R. Chang, J. Kadin, and S. Mitchell. Some Observations about Relativization of Space Bounded Computations. Bulletin of the European Association for Theoretical Computer Science, 35:82-92, June 1988. Columns: Structural Complexity.

[Hartmanis et al., 1990]

H. Hartmanis, R. Chang, D. Ranjan, and P. Rohatgi. On IP = PSPACE and theorems with narrow proofs. Bulletin of the European Association for Theoretical Computer Science, 41:166-174, June 1990. Columns: Structural Complexity.

[Hartmanis et al., 1992]

J. Hartmanis, R. Chang, S. Chari, D. Ranjan, and P. Rohatgi. Relativization: a revisionistic retrospective. Bulletin of the European Association for Theoretical Computer Science, 47:144-153, June 1992. Columns: Structural Complexity.

[Hartmanis, 1984]

J. Hartmanis. On non-isomorphic NP complete sets. Bulletin of the European Association for Theoretical Computer Science, 24:73-78, October 1984. Technical Contributions.

[Hartmanis, 1985]

J. Hartmanis. Solvable problems with conflicting relativizations. Bulletin of the European Association for Theoretical Computer Science, 27:40-49, October 1985. Technical Contributions.

[Hartmanis, 1987a]

J. Hartmanis. A retrospective on structural complexity. Bulletin of the European Association for Theoretical Computer Science, 31:115-122, February 1987. Columns: Structural Complexity.

[Hartmanis, 1987b]

J. Hartmanis. Sparse Complete Sets for NP and the Optimal Collapse of the Polynomial Hierarchy. Bulletin of the European Association for Theoretical Computer Science, 32:73-81, June 1987. Columns: Structural Complexity.

[Hartmanis, 1987c]

Juris Hartmanis. The Collapsing Hierarchies. Bulletin of the European Association for Theoretical Computer Science, 33:26-39, October 1987. Columns: Structural Complexity.

[Hartmanis, 1989a]

Juris Hartmanis. Gödel, von Neumann and the P =? NP Problem. Bulletin of the European Association for Theoretical Computer Science, 38:101-107, June 1989. Columns: Structural Complexity.

[Hartmanis, 1989b]

Juris Hartmanis. On the Importance of Being Pi ₂-Hard. Bulletin of the European Association for Theoretical Computer Science, 37:117-127, February 1989. Columns: Structural Complexity.

[Hartmanis, 1993]

J. Hartmanis. A Broader Research Agenda for Theory. Bulletin of the European Association for Theoretical Computer Science, 49:125-129, February 1993. Columns: Structural Complexity.

[Hartmanis, 1994]

J. Hartmanis. About the Nature of Computer Science. Bulletin of the European Association for Theoretical Computer Science, 53:170-190, June 1994. Columns: Structural Complexity.

[Hartmanis, 1995]

J. Hartmanis. On the Weight of Computations. Bulletin of the European Association for Theoretical Computer Science, 55:136-138, February 1995. Columns: Structural Complexity.

[Hasle and Øhrstrøm, 2004]

P. Hasle and P. Øhrstrøm. The Flow of Time into Logic - and Computer Science. Bulletin of the European Association for Theoretical Computer Science, 82:191-226, February 2004. Columns: Logic in Computer Science.

[Head and Gal, 2001]

T. Head and S. Gal. Aqueous Computing: Writing into Fluid Memory. Bulletin of the European Association for Theoretical Computer Science, 75:190--, October 2001. Columns: Natural Computing.

[Heckel and Engels, 2000]

R. Heckel and G. Engels. Graph Transformation and Visual Modeling Techniques. Bulletin of the European Association for Theoretical Computer Science, 71:186--, June 2000. Surveys and Tutorials.

[Hemachandra and Ogiwara, 1992]

L.A. Hemachandra and M. Ogiwara. Is #P Closed under Substraction? Bulletin of the European Association for Theoretical Computer Science, 46:107-122, February 1992. Columns: Structural Complexity.

[Hemaspaandra et al., 1997]

Edith Hemaspaandra, Lane A. Hemaspaandra, and Harald Hempel. An Introduction to Query Order. Bulletin of the European Association for Theoretical Computer Science, 63:93-107, October 1997. Columns: Computational Complexity.

[Hemmerling, 1984]

A. Hemmerling. A searching algorithm for finite embedded D-graphs with no more than k regions. Bulletin of the European Association for Theoretical Computer Science, 24:78-84, October 1984. Technical Contributions.

[Hemmerling, 1986]

A. Hemmerling. Real-time recognition of some languages by tellis and cellular automata and full scan Turing machines. Bulletin of the European Association for Theoretical Computer Science, 29:35-39, June 1986. Technical Contributions.

[Henno, 1980]

J. Henno. A partial solution to B. Reusch problem. Bulletin of the European Association for Theoretical Computer Science, 11:42-45, June 1980. Technical Contributions.

[Herlihy, 2009]

M. Herlihy. Transactional Memory: A Primer for Theorists. Bulletin of the European Association for Theoretical Computer Science, 98:123--, June 2009. Columns: Distributed Computing.

[Hermann and Ehrig, 2008]

F. Hermann and H. Ehrig. Process definition using subobject transformation systems. Bulletin of the European Association for Theoretical Computer Science, 95:153--, June 2008. Columns: Formal Specification.

[Hermanns, 2001]

H. Hermanns. Construction and Verification of Performance and Reliability Models. Bulletin of the European Association for Theoretical Computer Science, 74:135--, June 2001. Columns: Concurrency.

[Heuter, 1988]

Uschi Heuter. Definite Tree Languages. Bulletin of the European Association for Theoretical Computer Science, 35:137-142, June 1988. Technical Contributions.

[Hidders et al., 2005]

J. Hidders, P. Michiels, and R. Vercammen. Optimizing sorting and duplicate elimination in XQUERY path expressions. Bulletin of the European Association for Theoretical Computer Science, 86:199--, June 2005. Technical Contributions.

[Hinz and Dassow, 1989]

Friedhelm Hinz and Jürgen Dassow. An Undecidability Result for Regular Languages and its Applications to Regulated Rewriting. Bulletin of the European Association for Theoretical Computer Science, 38:168-173, June 1989. Technical Contributions.

[Hirvensalo, 1998]

M. Hirvensalo. An Introduction to Quantum Computing. Bulletin of the European Association for Theoretical Computer Science, 66:100-121, October 1998. Columns: Natural Computing.

[Hirvensalo, 2001]

M. Hirvensalo. Some Open Problems Related to Quantum Computing. Bulletin of the European Association for Theoretical Computer Science, 74:154--, June 2001. Columns: Natural Computing.

[Hirvensalo, 2002]

M. Hirvensalo. Universality and Quantum Computing. Bulletin of the European Association for Theoretical Computer Science, 78:199--, October 2002. Columns: Natural Computing.

[Hirvensalo, 2007]

M. Hirvensalo. EPR Paradox and Bell inequalities. Bulletin of the European Association for Theoretical Computer Science, 92:115-139, June 2007. Columns: Natural Computing.

[Hodkinson, 1993]

I. Hodkinson. Finite variable logics. Bulletin of the European Association for Theoretical Computer Science, 51:111-140, October 1993. Columns: Logic in Computer Science.

[Hodkinson, 1994]

I. Hodkinson. Addendum to: Finite Variable Logics. Bulletin of the European Association for Theoretical Computer Science, 52:278-279, February 1994. Technical Contributions.

[Hoffmann, 2010]

K. Hoffmann. Formal Modeling and Analysis of Mobile Ad Hoc Networks and Communication Based Systems using Graph and Net Technologies. Bulletin of the European Association for Theoretical Computer Science, 101:148-160, June 2010. Columns: Formal Specification.

[Holzer and König, 2004]

M. Holzer and B. König. Regular Languages, Sizes of Syntactic Monoids, Graph Colouring, State Complexity Results, and How These Topics are Related to Each Other. Bulletin of the European Association for Theoretical Computer Science, 83:139-155, June 2004. Columns: Formal Language Theory.

[Honda et al., 2007]

K. Honda, N. Yoshida, and M. Carbone. Web services, mobile processes and types. Bulletin of the European Association for Theoretical Computer Science, 91:160--, February 2007. Columns: Programming Languages.

[Honkala and Saloma, 1983]

Juha Honkala and Arto Saloma. How Do You Define the Complement of a Language. Bulletin of the European Association for Theoretical Computer Science, 20:68-69, June 1983. Technical Contributions.

[Honkala, 1996]

Juha Honkala. On the Equivalence Problem of Algebraic Series with Commuting Variables. Bulletin of the European Association for Theoretical Computer Science, 59:157-162, June 1996. Technical Contributions.

[Honkala, 1998a]

Juha Honkala. On a Problem of G. Paun. Bulletin of the European Association for Theoretical Computer Science, 64:341, February 1998. Problems and Solutions.

[Honkala, 1998b]

Juha Honkala. On Slender Languages. Bulletin of the European Association for Theoretical Computer Science, 64:145-152, February 1998. Columns: Formal Language Theory.

[Honkala, 1999]

J. Honkala. On Chains of Word Equations and Test Sets. Bulletin of the European Association for Theoretical Computer Science, 68:157--, June 1999. Technical Contributions.

[Honkala, 2000a]

J. Honkala. The D0L Problem Revisited. Bulletin of the European Association for Theoretical Computer Science, 70:142-147, February 2000. Columns: Formal Language Theory.

[Honkala, 2000b]

J. Honkala. Zeros of Z-rational Sequences and Thin 0L Languages. Bulletin of the European Association for Theoretical Computer Science, 72:178--, October 2000. Technical Contributions.

[Honkala, 2001]

J. Honkala. A Note on Uniform HDT0L Systems. Bulletin of the European Association for Theoretical Computer Science, 75:220--, October 2001. Technical Contributions.

[Honkala, 2002]

J. Honkala. A Note on Systems of Alternative Word Equations. Bulletin of the European Association for Theoretical Computer Science, 78:237--, October 2002. Technical Contributions.

[Honkala, 2003]

J. Honkala. The DF0L language equivalence problem. Bulletin of the European Association for Theoretical Computer Science, 80:143--, June 2003. Columns: Formal Language Theory.

[Honkala, 2006]

J. Honkala. The ultimate equivalence problem for uniform HDT0L systems. Bulletin of the European Association for Theoretical Computer Science, 90:127-130, October 2006. Columns: Formal Language Theory.

[Horváth, 1986]

S. Horváth. Finite, simple generating sytems for partial recursive functions. Bulletin of the European Association for Theoretical Computer Science, 28:30-32, February 1986. Technical Contributions.

[Høyer and Spalek, 2005]

Peter Høyer and Robert Spalek. Lower Bounds on Quantum Query Complexity. Bulletin of the European Association for Theoretical Computer Science, 87:78-103, October 2005. Columns: Complexity.

[Hromkovic, 1984a]

J. Hromkovic. On the power of Yao-Rivest technique. Bulletin of the European Association for Theoretical Computer Science, 23:33-35, June 1984. Technical Contributions.

[Hromkovic, 1984b]

Juraj Hromkovic. A Note on the 'Communication Complexity' Paper by Papadimitriou and Sipser. Bulletin of the European Association for Theoretical Computer Science, 22:20, February 1984. Technical Contributions.

[Hromkovic, 1988]

Juraj Hromkovic. A Candidate for Nonlinear Lower Bound on the Combinatonal Complexity. Bulletin of the European Association for Theoretical Computer Science, 36:126-128, October 1988. Technical Contributions.

[Hromkovic, 1989]

Juraj Hromkovic. The Knowledge on Information Content of Problems Provides Much Useful Information to Circuit Designers. Bulletin of the European Association for Theoretical Computer Science, 39:154-171, October 1989. Technical Contributions.

[Hu, 1993]

X.-L. Hu. The representation of a program in the Blum-Shub-Smale theory of computation over an arbitrary ring. Bulletin of the European Association for Theoretical Computer Science, 51:226-228, October 1993. Technical Contributions.

[Ibarra, 1991]

O.H. Ibarra. On Resetting DLBA's. Bulletin of the European Association for Theoretical Computer Science, 44:190-191, June 1991. Technical Contributions.

[Ilie, 1997]

Lucian Ilie. Some Recent Results on Contextual Languages. Bulletin of the European Association for Theoretical Computer Science, 62:176-194, June 1997. Columns: Formal Language Theory.

[Imai, 1990]

H. Imai. Computation Geometry: Research in Japan. Bulletin of the European Association for Theoretical Computer Science, 40:164-167, February 1990. Columns: Computational Geometry.

[Immerman, 1999]

N. Immerman. Progress in Descriptive Complexity. Bulletin of the European Association for Theoretical Computer Science, 67:72-80, February 1999. Columns: Computational Complexity.

[Inverardi and Priami, 1991]

P. Inverardi and C. Priami. Evaluation of Tools for the Analysis of Communicating Systems. Bulletin of the European Association for Theoretical Computer Science, 45:158-185, October 1991. Technical Contributions.

[Istrael, 1983a]

S. Istrael. A Programming Exercise with Some Theoretical Appeal: The Piling of Counters I. Bulletin of the European Association for Theoretical Computer Science, 20:70-85, June 1983. Technical Contributions.

[Istrael, 1983b]

S. Istrael. A Programming Exercise with Some Theoretical Appeal: The Piling of Counters II. Bulletin of the European Association for Theoretical Computer Science, 20:85-97, June 1983. Technical Contributions.

[Istrail, 1981]

Sorin Istrail. On the scientific activity of Laurent Chottin (1947-1979). Bulletin of the European Association for Theoretical Computer Science, 15:139-146, October 1981. Obituaries.

[Istrail, 1983]

S. Istrail. A Solution to Wegner's Problem P12. Bulletin of the European Association for Theoretical Computer Science, 19:20-24, February 1983. Technical Contributions.

[Iwama, 2004]

K. Iwama. Worst-Case Upper Bounds for kSAT. Bulletin of the European Association for Theoretical Computer Science, 82:61-71, February 2004. Columns: Algorithmics.

[Jacobs and Rutten, 1997]

Bart Jacobs and Jan Rutten. A Tutorial on (Co)Algebras and (Co)Induction. Bulletin of the European Association for Theoretical Computer Science, 62:222-259, June 1997. Surveys and Tutorials.

[Ja'Ja', 1978]

Joseph Ja'Ja'. Optimal Evaluation of Pairs of Bilinear Forms. Bulletin of the European Association for Theoretical Computer Science, 4:2, January 1978. Technical Contributions.

[Jancar, 1995]

P. Jancar. All action-based behavioural equivalences are undecidable for labelled Petri nets. Bulletin of the European Association for Theoretical Computer Science, 56, June 1995. Columns: Concurrency Column.

[Janko, 1982]

Wolfgang H. Janko. A Bibliography on Randomized Algorithms. Bulletin of the European Association for Theoretical Computer Science, 18:16-26, October 1982. Technical Contributions.

[Janko, 1983]

Wolfgang H. Janko. Addendum to A Bibliography on Randomized Algorithms. Bulletin of the European Association for Theoretical Computer Science, 20:98-103, June 1983. Technical Contributions.

[Jantke, 1981]

Klaus P. Jantke. A characterization theorem on partial recursive functions and abstract data types. Bulletin of the European Association for Theoretical Computer Science, 15:40-46, October 1981. Technical Contributions.

[Jantzen, 1980]

Matthias Jantzen. A note on iterating inverse morphisms. Bulletin of the European Association for Theoretical Computer Science, 12:62-64, October 1980. Technical Contributions.

[Jantzen, 1982]

Matthias Jantzen. Two Questions about [Inherently Ambiguous] Context-Free Languages. Bulletin of the European Association for Theoretical Computer Science, 18:119, October 1982. Problems.

[Jantzen, 1986]

M. Jantzen. Confluent string rewriting and congruences. Bulletin of the European Association for Theoretical Computer Science, 28:52-72, February 1986. Surveys and tutorials.

[Jedrzejowicz, 1993]

J. Jedrzejowicz. Remark on shuffle identities. Bulletin of the European Association for Theoretical Computer Science, 50:222-223, June 1993. Technical Contributions.

[Johnson, 1985]

David S. Johnson. The genealogy of theoretical computer science -- A preliminary report. Bulletin of the European Association for Theoretical Computer Science, 25:198-211, February 1985. Miscellaneous.

[Johnson, 1986]

J. Howard Johnson. Rational equivalence relations. Bulletin of the European Association for Theoretical Computer Science, 30:260-261, October 1986. Problems and Solutions.

[Jones, 1978]

Neil D. Jones. Blindfold games are harder than games with perfect information. Bulletin of the European Association for Theoretical Computer Science, 6:4-7, October 1978. Technical Contributions.

[Jonoska, 2006]

N. Jonoska. Biomolecular Automata. Bulletin of the European Association for Theoretical Computer Science, 88:141-166, February 2006. Columns: Natural Computing.

[Joseph and Young, 1988]

Deborah Joseph and Paul Young. Self-Reducibility: teh Effects of Structure on Complexity. Bulletin of the European Association for Theoretical Computer Science, 36:66-84, October 1988. Columns: Structural Complexity.

[Jouannaud and Kounalis, 1985]

J.-P. Jouannaud and E. Kounalis. Proofs by induction in equational theories without constructors. Bulletin of the European Association for Theoretical Computer Science, 27:49-55, October 1985. Technical Contributions.

[Jouannaud, 1985]

J.-P. Jouannaud. ( Proofs in equational theories, Open problems ). Bulletin of the European Association for Theoretical Computer Science, 27:244-245, October 1985. Problems and Solutions Technical Contributions.

[Jouannaud, 1987]

Jean-Pierre Jouannaud. A set of 11 important open problems in Term Rewriting based Theorem Proving. Bulletin of the European Association for Theoretical Computer Science, 31:272-273, February 1987. Problems and Solutions.

[Jousselin and Moskowitz, 1989]

C. Jousselin and J-P. Moskowitz. Memory and Algebra. Bulletin of the European Association for Theoretical Computer Science, 38:174-180, June 1989. Technical Contributions.

[Kabanets, 2002]

V. Kabanets. Derandomization: a brief overview. Bulletin of the European Association for Theoretical Computer Science, 76:88-103, February 2002. Columns: Computational Complexity.

[Kahn and Ahmad, 2004]

S.U. Kahn and I. Ahmad. Some Preliminary Results on Three Combinatorial Board Games. Bulletin of the European Association for Theoretical Computer Science, 84:159-166, October 2004. Technical Contributions.

[Kant and van Leeuwen, 1990]

G. Kant and J. van Leeuwen. On special multiples of integers. Bulletin of the European Association for Theoretical Computer Science, 41:210-211, June 1990. Technical Contributions.

[Kaplan and Choquer, 1986]

S. Kaplan and M. Choquer. On the decidability of quasi-reducibility. Bulletin of the European Association for Theoretical Computer Science, 28:32-34, February 1986. Technical Contributions.

[Kapur and Narendram, 1987]

Deepak Kapur and Paliath Narendram. Sufficient-Completeness, Quasi-reducibility, and their Complexity. Bulletin of the European Association for Theoretical Computer Science, 33:279-281, October 1987. Problems and Solutions.

[Karhumäki and Petre, 2001]

J. Karhumäki and I. Petre. Conway's Problem and the Communication of Languages. Bulletin of the European Association for Theoretical Computer Science, 74:171--, June 2001. Columns: Formal Language Theory.

[Karhumäki and Simon, 1979]

Juhani Karhumäki and Imre Simon. A Note on Elementary Homomorphisms and the Regularity of Equality Sets. Bulletin of the European Association for Theoretical Computer Science, 9:16-24, October 1979. Technical Contributions.

[Karhumäki, 1988]

J. Karhumäki. The Impact of the D0L Problem. Bulletin of the European Association for Theoretical Computer Science, 34:41-46, February 1988. Columns: Formal Language Theory.

[Kari and Sosík, 2004]

L. Kari and P. Sosík. On Language Equations with Deletion. Bulletin of the European Association for Theoretical Computer Science, 83:173-180, June 2004. Technical Contributions.

[Kari and Taati, 2008]

J. Kari and S. Taati. Combinatorics of conservation laws. Bulletin of the European Association for Theoretical Computer Science, 95:183--, June 2008. Columns: Natural Computing.

[Kari et al., 1992]

L. Kari, S. Marcus, G. Paun, and A. Salomaa. In the prehistory of formal language theory: Gauss Languages. Bulletin of the European Association for Theoretical Computer Science, 46:124-139, February 1992. Columns: Formal Language Theory.

[Kari, 1990]

J. Kari. Games played on the plane: Solitaire and Cellular Automata. Bulletin of the European Association for Theoretical Computer Science, 40:195-200, February 1990. Columns: Formal Language Theory.

[Kari, 1993]

L. Kari. Insertion operations: closure properties. Bulletin of the European Association for Theoretical Computer Science, 51:181-191, October 1993. Columns: Formal Language Theory.

[Kari, 1996]

Lila Kari. DNA Computers, Tomorrow's Reality. Bulletin of the European Association for Theoretical Computer Science, 59:256 --266, June 1996. Surveys and Tutorials.

[Kari, 2001]

J. Kari. A Counter Example to a Conjecture Concerning Synchronizing Words in Finite Automata. Bulletin of the European Association for Theoretical Computer Science, 73:146--, February 2001. Technical Contributions.

[Karp, 2000]

R.M. Karp. The Genomics Revolution and its Challenges for Algorithmic Research. Bulletin of the European Association for Theoretical Computer Science, 71:151--, June 2000. Reflections.

[Katajainen and Mäkinen, 1990]

J. Katajainen and E. Mäkinen. A note on the complexity of trie compaction. Bulletin of the European Association for Theoretical Computer Science, 41:212-216, June 1990. Technical Contributions.

[Katsányi, 2004]

I. Katsányi. A Note on Restricted Insertion-Deletion Systems. Bulletin of the European Association for Theoretical Computer Science, 83:181-185, June 2004. Technical Contributions.

[Kaufmann and Müller, 1984]

K.D. Kaufmann and H. Müller. Calculating the orientation of simple polygons (Problem P69 of G. Knott). Bulletin of the European Association for Theoretical Computer Science, 24:222, October 1984. Problems and Solutions.

[Kelemenová and Kelemen, 1984]

A. Kelemenová and J. Kelemen. Interview with A. Lindenmayer (for 'the journal of the society of Czechoslovak Mathematicians and Physicists'). Bulletin of the European Association for Theoretical Computer Science, 23:185-198, June 1984. Miscellaneous.

[Kelemenová and Kelemen, 1986]

A. Kelemenová and J. Kelemen. Questions to Prof. A. Salomaa (an interview for 'the journal of the society of Czechoslovak Mathematicians and Physicists'). Bulletin of the European Association for Theoretical Computer Science, 28:230-236, February 1986. Miscellaneous.

[Kennaway, 1984]

J.R. Kennaway. Solution of Bull.EATCS Problem 68. Bulletin of the European Association for Theoretical Computer Science, 24:220-221, October 1984. Problems and Solutions.

[Keränen, 1983]

Veikko Keränen. On L. Wegner's Problem in the General Case. Bulletin of the European Association for Theoretical Computer Science, 19:24-31, February 1983. Technical Contributions.

[Kfoury, 1986]

A.J. Kfoury. A linear time algorithm to decide whether a binary word contains an overlap. Bulletin of the European Association for Theoretical Computer Science, 30:74-80, October 1986. Technical Contributions.

[Khan and Ahmad, 2005]

S.U. Khan and I. Ahmad. Combinatorial Pawn Power. Bulletin of the European Association for Theoretical Computer Science, 85:151-164, February 2005. Technical Contributions.

[Khan, 2003]

S.U. Khan. Plays, Values, Analysis and the Complexity of Chinese Chess. Bulletin of the European Association for Theoretical Computer Science, 81:253-263, October 2003. Technical Contributions.

[Khan, 2004]

S.U. Khan. Integers, Game Trees and some Unknowns. Bulletin of the European Association for Theoretical Computer Science, 82:255-262, February 2004. Technical Contributions.

[Khoussainov et al., 2008]

B. Khoussainov, , and A. Nerode. Open questions in the theory of automatic structures. Bulletin of the European Association for Theoretical Computer Science, 94:181--, February 2008. Columns: Logics in Computer Science.

[Kinber et al., 1986]

E. Kinber, A. Salomaa, and S. Yu. On the equivalence of grammars inferred from derivation. Bulletin of the European Association for Theoretical Computer Science, 29:39-46, June 1986. Technical Contributions.

[Kinber, 1984]

E.B. Kinber. On the problem P9(2) of J. Case. Bulletin of the European Association for Theoretical Computer Science, 23:178-183, June 1984. Problems and Solutions.

[Kindler and Weber, 1998]

E. Kindler and M. Weber. The Dimensions of Petri Nets: The Petri Net Cube. Bulletin of the European Association for Theoretical Computer Science, 66:155-166, October 1998. Technical Contributions.

[Kindler, 1994]

E. Kindler. Safety and Liveness Properties: A Survey. Bulletin of the European Association for Theoretical Computer Science, 53:268-272, June 1994. Surveys and Tutorials.

[Klaeren, 1980]

Herbert A. Klaeren. Bibliography on abstract software specification. Bulletin of the European Association for Theoretical Computer Science, 12:76-87, October 1980. Technical Contributions.

[Kleijn and Rozenberg, 1985]

Jetty Kleijn and Grzegorz Rozenberg. Problems ( on pattern grammars, P111-- P113). Bulletin of the European Association for Theoretical Computer Science, 26:240-241, June 1985. Problems and Solutions.

[Klempien-Hinrichs and Kreowski, 2001]

R. Klempien-Hinrichs and H.-J. Kreowski. Algebraic Specification goes Multimedia -- A Few Tentative Steps. Bulletin of the European Association for Theoretical Computer Science, 75:224--, October 2001. Educational Matters.

[Klop, 1982]

Jan Willem Klop. Extending partial combinatory algebras. Bulletin of the European Association for Theoretical Computer Science, 16:30-34, February 1982. Technical Contributions.

[Klop, 1983]

Jan Willem Klop. A Solution to Problem P12 (number 18, October 1982). Bulletin of the European Association for Theoretical Computer Science, 19:31-33, February 1983. Technical Contributions.

[Klop, 1987]

Jan Willem Klop. Term Rewriting Systems: A Tutorial. Bulletin of the European Association for Theoretical Computer Science, 32:143-182, June 1987. Surveys and Tutorials.

[Klostermeyer, 1999]

W. Klostermeyer. Maximization versus Minimization in Some Optimization Problems. Bulletin of the European Association for Theoretical Computer Science, 69:137-140, October 1999. Technical Contributions.

[Knuth, 1985]

D. Knuth. Theory and Practice. Bulletin of the European Association for Theoretical Computer Science, 27:14--, October 1985. ICALP'86.

[Köbler and Lindner, 2006]

J. Köbler and W. Lindner. Learning Boolean Functions under the Uniform Distribution via the Fourier Transform. Bulletin of the European Association for Theoretical Computer Science, 89:48, June 2006. Columns: Complexity.

[Kohlenbach, 2007]

U. Kohlenbach. Proof interpretations and the computational content of proofs in mathematics. Bulletin of the European Association for Theoretical Computer Science, 93:143--, October 2007. Columns: Logics in Computer Science.

[Kok and Kosters, 2000]

J.N. Kok and W.A. Kosters. Natural Data Mining Techniques. Bulletin of the European Association for Theoretical Computer Science, 71:133--, June 2000. Columns: Natural Computing.

[König and Kozioura, 2005]

Barbara König and Vitali Kozioura. Augur - A Tool for the Analysis of Graph Transformation Systems. Bulletin of the European Association for Theoretical Computer Science, 87:126-137, October 2005. Columns: Formal Specification.

[Kontogiannis et al., 2009]

S. Kontogiannis, P. Spirakis, and H. Tsaknakis. Recents Advances in Approximability of Bimatrix Nash. Bulletin of the European Association for Theoretical Computer Science, 98:80--, June 2009. Columns: Algorithmic Game Theory.

[Korec, 1984]

I. Korec. Two kinds of processors are sufficient and large operating alphabets are needed for regular trellis automata languages. Bulletin of the European Association for Theoretical Computer Science, 23:35-42, June 1984. Technical Contributions.

[Koshelev et al., 1999]

M. Koshelev, V. Kreinovich, and L. Longpré. Encryption Algorithms Made (Somewhat) More Natural (a pedagogical remark). Bulletin of the European Association for Theoretical Computer Science, 67:153-156, February 1999. Technical Contributions.

[Koshelev, 1998]

M. Koshelev. Towards the Use of Aesthetics in Decision Making: Kolmogorov Complexity Formalizes Birkhoff's Idea. Bulletin of the European Association for Theoretical Computer Science, 66:166-170, October 1998. Technical Contributions.

[Kounalis and Rusinowitch, 1990]

E. Kounalis and M. Rusinowitch. Mechanizing inductive reasoning. Bulletin of the European Association for Theoretical Computer Science, 41:216-226, June 1990. Technical Contributions.

[Koutsoupias, 2003]

E. Koutsoupias. Selfish Task Allocation. Bulletin of the European Association for Theoretical Computer Science, 81:79-88, October 2003. Columns: Algorithmics.

[Kozen, 1992]

D. Kozen. On the Myhill-Nerode theorem for trees. Bulletin of the European Association for Theoretical Computer Science, 47:170-173, June 1992. Technical Contributions.

[Kozen, 1996a]

D. Kozen. Erratum: On Regularity-Preserving Functions. Bulletin of the European Association for Theoretical Computer Science, 59:455, June 1996.

[Kozen, 1996b]

D. Kozen. On Regularity-Preserving Functions. Bulletin of the European Association for Theoretical Computer Science, 58:131-138, February 1996. Columns: Structural Complexity.

[Kranakis and Meertens, 1989]

Evangelos Kranakis and Lambert Meertens. Optimal Packing of Similar Triangles. Bulletin of the European Association for Theoretical Computer Science, 38:181-185, June 1989. Technical Contributions.

[Krasnogor et al., 2005]

N. Krasnogor, M. Gheorghe, G. Terrazas, S. Diggle, P. Williams, and M. Camara. An Appealing Computational Mechanism Drawn from Bacterial Quorum Sensing. Bulletin of the European Association for Theoretical Computer Science, 85:135-148, February 2005. Columns: Natural Computing.

[Kreinovich and Longpré, 1998]

Vladik Kreinovich and Luc Longpré. Human Visual Perception and Kolmogorov Complexity: Revisited. Bulletin of the European Association for Theoretical Computer Science, 64:155-158, February 1998. Technical Contributions.

[Kreinovich and Longpré, 2000]

V. Kreinovich and L. Longpré. How Important is Theory for Practical Problems? A Partial Explanation of Hartmanis' Observation. Bulletin of the European Association for Theoretical Computer Science, 71:160--, June 2000. Technical Contributions.

[Kreinovich and Longpré, 2002]

V. Kreinovich and L. Longpré. Why is Selecting the Simplest Hypothesis (Consistent with Data) a Good Idea? A Simple Explanation. Bulletin of the European Association for Theoretical Computer Science, 77:191--, June 2002. Technical Contributions.

[Kreowski, 1981]

Hans-Jörg Kreowski. Playing the token game in an algebra -- Just a definition. Bulletin of the European Association for Theoretical Computer Science, 15:46-50, October 1981. Technical Contributions.

[Kreowski, 1985]

H.-J. Kreowski. Parallelism and concurrency in graph grammars (incomplete sketch). Bulletin of the European Association for Theoretical Computer Science, 25:63-79, February 1985. Surveys and Tutorials.

[Kreowski, 1987]

Hans-Jörg Kreowski. Some initial sections of the algebraic-specification tale. Bulletin of the European Association for Theoretical Computer Science, 31:55-78, February 1987. Surveys and Tutorials.

[Kreowski, 1991]

H.-J. Kreowski. Arguments for an IFIP Working Group on Mathematical Aspects of Systems Specification. Bulletin of the European Association for Theoretical Computer Science, 44:144-146, June 1991. Columns: Algebraic Specification.

[Kreowski, 1992]

H.-J. Kreowski. Educational Matters. Bulletin of the European Association for Theoretical Computer Science, 47:208-214, June 1992. Educational Matters.

[Kreowski, 1993]

H.-J. Kreowski. Educational Matters. Bulletin of the European Association for Theoretical Computer Science, 50:329-331, June 1993. Educational Matters.

[Kreowski, 1995]

H.-J. Kreowski. Conception of a Course on Syntactic Methods in Picture Generation. Bulletin of the European Association for Theoretical Computer Science, 55:208-213, February 1995. Educational Matters.

[Kreowski, 1996]

H.-J. Kreowski. Educational Matters. Bulletin of the European Association for Theoretical Computer Science, 59:294-296, June 1996. Educational Matters.

[Kreowski, 1997]

Hans-Jörg Kreowski. Call for Contributions: On the (im-)possibilities of teaching theoretical computer science. Bulletin of the European Association for Theoretical Computer Science, 62:260-261, June 1997. Educational Matters.

[Kreowski, 1999]

H.-J. Kreowski. The Teaching of TCS at the University of Bremen. Bulletin of the European Association for Theoretical Computer Science, 67:185-189, February 1999. Educational Matters.

[Kreowski, 2000]

H.-J. Kreowski. The joy of teaching Theoretical Computer Science. Bulletin of the European Association for Theoretical Computer Science, 70:164-166, February 2000. Educational Matters Educational Matters.

[Krieg-Brückner, 2002]

B. Krieg-Brückner. A Note on MMiSS. Bulletin of the European Association for Theoretical Computer Science, 78:252--, October 2002. Education Matters.

[Krishna and Rama, 2001]

S.N. Krishna and R. Rama. A Note on Parallel Rewriting in P Systems. Bulletin of the European Association for Theoretical Computer Science, 73:147--, February 2001. Technical Contributions.

[Krithivasan and Varma, 2003]

K. Krithivasan and S.V. Varma. On Minimising P Finite State Automata. Bulletin of the European Association for Theoretical Computer Science, 80:168--, June 2003. Technical Contributions.

[Kucherov et al., 1995]

Gregory Kucherov, Pierre Lescanne, and Peter Mosses. V. Antimirov - Obituary. Bulletin of the European Association for Theoretical Computer Science, 57:369, October 1995.

[Kuich, 1981]

W. Kuich. Formal power series and one-way stack automata. Bulletin of the European Association for Theoretical Computer Science, 15:50 --54, October 1981. Technical Contributions.

[Kuich, 1987]

Werner Kuich. Unambiguous Automata. Bulletin of the European Association for Theoretical Computer Science, 33:62-67, October 1987. Technical Contributions.

[Kunc, 2005]

M. Kunc. Simple language Equations. Bulletin of the European Association for Theoretical Computer Science, 85:81-102, February 2005. Columns: Formal Language Theory.

[Kunen, 1991]

K. Kunen. Declarative Semantics of Logic Programming. Bulletin of the European Association for Theoretical Computer Science, 44:147-167, June 1991. Columns: Logic in Computer Science.

[Kupferman, 2007]

O. Kupferman. Exponential gaps in out knowledge. Bulletin of the European Association for Theoretical Computer Science, 92:44-64, June 2007. Columns: Concurrency.

[Lange and Schudy, 1987]

Klaus-Jörn Lange and Michael Schudy. A Further Link between Formal Languages and Complexity Theory. Bulletin of the European Association for Theoretical Computer Science, 33:67-71, October 1987. Technical Contributions.

[Lange, 1985a]

K.-J. Lange. A note on the closure of E0L-languages under erasing homomorphisms. Bulletin of the European Association for Theoretical Computer Science, 25:22-24, February 1985. Technical Contributions.

[Lange, 1985b]

Klaus-Jörn Lange. Addendum to 'A note on the closure of E0L languages under erasing homomorphisms'. Bulletin of the European Association for Theoretical Computer Science, 26:55, June 1985. Technical Contributions.

[Lange, 1987]

Steffen Lange. On the construction of unifying terms modulo a set of substitutions. Bulletin of the European Association for Theoretical Computer Science, 31:29-35, February 1987. Technical Contributions.

[Laroussinie, 2010]

F. Laroussinie. Temporal Logics for Games. Bulletin of the European Association for Theoretical Computer Science, 100:79--, February 2010. Columns: Concurrency.

[Lauer, 1983]

P. E. Lauer. A Bibliography of a Project on Formal Models of Concurrency. Bulletin of the European Association for Theoretical Computer Science, 20:103-107, June 1983. Technical Contributions.

[Lautemann, 1988]

Clemens Lautemann. A Note on Polynomial Interpretation. Bulletin of the European Association for Theoretical Computer Science, 36:129-131, October 1988. Technical Contributions.

[Lautenbach and Pagnoni, 1984]

K. Lautenbach and A. Pagnoni. On the various high-level Petri-Nets and their invariants. Bulletin of the European Association for Theoretical Computer Science, 23:42-58, June 1984. Technical Contributions.

[Lawrence, 1986]

J. Lawrence. The non-existence of finite test sets for set-equivalence of finite substitutions. Bulletin of the European Association for Theoretical Computer Science, 28:34-37, February 1986. Technical Contributions.

[Lehikoinen and Mäkinen, 1995]

J. Lehikoinen and E. Mäkinen. A New Distance-based Coding Method For Binary Trees. Bulletin of the European Association for Theoretical Computer Science, 55:166-169, February 1995. Technical Contributions.

[Leiss, 1980]

Ernst Leiss. Constructing a finite automaton for a given regular expression. Bulletin of the European Association for Theoretical Computer Science, 10:54-59, January 1980. Technical Contributions.

[Leiss, 1989]

Ernst L. Leiss. More on Minimal Finite Automata. Bulletin of the European Association for Theoretical Computer Science, 37:151-152, February 1989. Technical Contributions.

[Lengauer and Wanke, 1988]

Thomas Lengauer and Egon Wanke. Efficient Processing of Hierarchical Graphs for Engineering Design. Bulletin of the European Association for Theoretical Computer Science, 35:143-157, June 1988. Technical Contributions.

[Lenstra, 1984]

A.K. Lenstra. Polynomial-time algorithms for the factorization of polynomials. Bulletin of the European Association for Theoretical Computer Science, 23:59-76, June 1984. Technical Contributions.

[Lescanne, 1986]

P. Lescanne. Divergence of the Knuth-Bendix completion procedure and termination orderings. Bulletin of the European Association for Theoretical Computer Science, 30:80-83, October 1986. Technical Contributions.

[Lescanne, 1989]

Pierre Lescanne. Well Quasi-Ordering in a Paper by Maurice Janet. Bulletin of the European Association for Theoretical Computer Science, 39:185-188, October 1989. Technical Contributions.

[Leuchner et al., 1991]

J. Leuchner, L. Miller, and G. Slutzki. Agreement Graph Dependencies. Bulletin of the European Association for Theoretical Computer Science, 45:202-217, October 1991. Technical Contributions.

[Levé and Richomme, 2004]

F. Levé and G. Richomme. Quasiperiodic Infinite Words: Some Answers. Bulletin of the European Association for Theoretical Computer Science, 84:128-138, October 2004. Columns: Formal Language Theory.

[Libkin, 1992]

L. Libkin. An elementary proof that upper and lower powerdomain constructions commute. Bulletin of the European Association for Theoretical Computer Science, 48:175-177, October 1992. Technical Contributions.

[Libkin, 2006]

L. Libkin. Embedded Finite Models. Bulletin of the European Association for Theoretical Computer Science, 90:134-149, October 2006. Columns: Logics in Computer Science.

[Lingas, 1990]

A. Lingas. A Note on a Parallel Heuristic for Minimum Vertex Cover. Bulletin of the European Association for Theoretical Computer Science, 42:174-177, October 1990. Technical Contributions.

[Linna, 1978]

M. Linna. The FPP-Problem for Regular Languages. Bulletin of the European Association for Theoretical Computer Science, 5:22-27, June 1978. Technical Contributions.

[Lippe, 1979]

Wolfram-M. Lippe. Context-Sensitive Top-Down Creative Dendrogrammars. Bulletin of the European Association for Theoretical Computer Science, 9:41-45, October 1979. Technical Contributions.

[Lipponen and Salomaa, 1996]

M. Lipponen and A. Salomaa. Simple Words in Equality Sets. Bulletin of the European Association for Theoretical Computer Science, 60:123-143, October 1996. Columns: Formal Language Theory.

[Lipponen, 1994]

M. Lipponen. Primitive Words and Languages Associated to PCP. Bulletin of the European Association for Theoretical Computer Science, 53:217-226, June 1994. Technical Contributions.

[Lisovnik, 1997]

Leonid P. Lisovnik. Nondeterministic systems and finite substitutions on regular languages. Bulletin of the European Association for Theoretical Computer Science, 63:156-160, October 1997. Technical Contributions.

[Loch, 1990]

W. Loch. On the equivalence problem for DTOL systems. Bulletin of the European Association for Theoretical Computer Science, 40:237-246, February 1990. Technical Contributions.

[Loeckx, 1990]

J. Loeckx. The Specification System OBSCURE. Bulletin of the European Association for Theoretical Computer Science, 40:169-171, February 1990. Columns: Computational Geometry.

[Longo and Martini, 1983]

G. Longo and S. Martini. Computability in Higher Types and the Universal Domain P omega . Bulletin of the European Association for Theoretical Computer Science, 20:107-114, June 1983. Technical Contributions.

[Longpré and Kreinovich, 1996]

Luc Longpré and Vladik Kreinovich. Zeros of Riemann's Zeta Function are Uniformly Distributed, but not Random: An Answer to Calude's Open Problem. Bulletin of the European Association for Theoretical Computer Science, 59:163-164, June 1996. Technical Contributions.

[Longpré and Kreinovich, 2003]

L. Longpré and V. Kreinovich. Can quantum computers be useful when there are not yet enough qubits? Bulletin of the European Association for Theoretical Computer Science, 79:164--, February 2003. Technical Contributions.

[Losseva, 2003]

E. Losseva. Building Reliable Systems from Unreliable Components and the DNA Computing Paradigm. Bulletin of the European Association for Theoretical Computer Science, 81:305-317, October 2003. Technical Contributions.

[Lozano, 1988]

Antonio Lozano. NP-Hardness on Succinct Representations of Graphs. Bulletin of the European Association for Theoretical Computer Science, 35:158-163, June 1988. Technical Contributions.

[Luttik, 2006]

B. Luttik. What is algebraic in process theory? Bulletin of the European Association for Theoretical Computer Science, 88:66-83, February 2006. Columns: Concurrency.

[Lutz and Mayordomo, 1999]

J.H. Lutz and E. Mayordomo. Twelve Problems in Resource-Bounded Measure. Bulletin of the European Association for Theoretical Computer Science, 68:64--, June 1999. Columns: Computational Complexity.

[Lutz, 1997]

J. Lutz. Report on the Workshop on Languages, Algorithms and Complexity, Minneapolis, U.S.A. Bulletin of the European Association for Theoretical Computer Science, 62:103, June 1997. Columns: Computational Complexity.

[Maass, 2000]

W. Maass. Neural Computation: A Research Topic for Theoretical Computer Science? Some Thoughts and Pointers. Bulletin of the European Association for Theoretical Computer Science, 72:149--, October 2000. Columns: Natural Computing.

[Madhu and Krithivasan, 2002]

M. Madhu and K. Krithivasan. Improved Results about Universality of P systems. Bulletin of the European Association for Theoretical Computer Science, 76:162-168, February 2002. Technical Contribution.

[Madsen, 2002]

O. Lehrmann Madsen. Kristen Nygaard, Obituary. Bulletin of the European Association for Theoretical Computer Science, 78:325--, October 2002. Miscellaneous.

[Maffeis, 2007]

S. Maffeis. Dynamic web data and process calculi. Bulletin of the European Association for Theoretical Computer Science, 93:76--, October 2007. Columns: Concurrency.

[Mahajan, 2007]

M. Mahajan. Polynomial size log depth circuits: between NC1 and AC1. Bulletin of the European Association for Theoretical Computer Science, 91:42, February 2007. Columns: Complexity.

[Main and Shultis, 1985]

M.G. Main and J. Shultis. Open Problem: Searching k sorted lists. Bulletin of the European Association for Theoretical Computer Science, 27:246, October 1985. Problems and Solutions Technical Contributions.

[Main, 1987a]

Michael G. Main. Detecting leftmost Periodicities. Bulletin of the European Association for Theoretical Computer Science, 32:93-97, June 1987. Technical Contributions.

[Main, 1987b]

Michael G. Main. A Powerdomain Primer. Bulletin of the European Association for Theoretical Computer Science, 33:115-147, October 1987. Surveys and Tutorials.

[Main, 2009]

M. Main. Quantum Pseudo-Telepathy Saves the World. Bulletin of the European Association for Theoretical Computer Science, 99:153--, October 2009. Columns: Natural Computing.

[Majster-Cederbaum and Roggenbach, 1996]

Mila Majster-Cederbaum and Markus Roggenbach. On two different Characterizations of Bisimulation. Bulletin of the European Association for Theoretical Computer Science, 59:164-172, June 1996. Technical Contributions.

[Mäkinen, 1987]

Erkki Mäkinen. Normal forms for pure context-free grammars. Bulletin of the European Association for Theoretical Computer Science, 31:35-38, February 1987. Technical Contributions.

[Mäkinen, 1992]

E. Mäkinen. A note on Graftings, Rotations, and Distances in Binary Trees. Bulletin of the European Association for Theoretical Computer Science, 46:146-148, February 1992. Technical Contributions.

[Mäkinen, 1993]

E. Mäkinen. A Note on Gupta's Binary Tree Codings. Bulletin of the European Association for Theoretical Computer Science, 49:163-164, February 1993. Technical Contributions.

[Mäkinen, 1998]

E. Mäkinen. A Bibliography on Szilard Languages. Bulletin of the European Association for Theoretical Computer Science, 65:143--, June 1998. Bibliographies.

[Mäkinen, 2000]

E. Mäkinen. A Conjecture on the Error Bound of the Barycenter Heuristic. Bulletin of the European Association for Theoretical Computer Science, 70:156-158, February 2000. Technical Contributions.

[Maler and Staiger, 1994]

O. Maler and L. Staiger. On Syntactic Congruences for Omega-Languages and the Minimization of Omega-Automata. Bulletin of the European Association for Theoretical Computer Science, 53:447-448, June 1994. Problems and Solutions.

[Malkhi, 2004]

D. Malkhi. Locality-Aware Network Solutions (A survey). Bulletin of the European Association for Theoretical Computer Science, 83:121-138, June 2004. Columns: Distributed Computing.

[Mann, 1998]

E. Mann. Some Recommendations for a New Orientation of the Community's R&D Framework Programme. Bulletin of the European Association for Theoretical Computer Science, 65:44--, June 1998. European Community R&D Framework Programme.

[Maon, 1985]

Y. Maon. A partial answer to problem P97 Of J. Karhumäki. Bulletin of the European Association for Theoretical Computer Science, 27:248-250, October 1985. Problems and Solutions Technical Contributions.

[Marcus and Paun, 1994]

S. Marcus and G. Paun. Infinite (Almost Periodic) Words, Formal Languages and Dynamical Systems. Bulletin of the European Association for Theoretical Computer Science, 54:224-231, October 1994. Technical Contributions.

[Marcus, 1985]

S. Marcus. Problems. Bulletin of the European Association for Theoretical Computer Science, 27:245, October 1985. Problems and Solutions Technical Contributions.

[Marcus, 1988]

Solomon Marcus. Formal Languages before Axel Thue ? Bulletin of the European Association for Theoretical Computer Science, 34:62, February 1988. Technical Contributions.

[Marcus, 2004]

S. Marcus. Quasiperiodic Infinite Words. Bulletin of the European Association for Theoretical Computer Science, 82:170-174, February 2004. Columns: Formal Language Theory.

[Marcus, 2006]

S. Marcus. Z. Pawlak - a Precursor of DNA Computing and of Picture Grammars. Bulletin of the European Association for Theoretical Computer Science, 90:150-154, October 2006. Columns: Natural Computing.

[Margenstern, 2007]

M. Margenstern. The domino problem of the hyperboiic plane is undecidable. Bulletin of the European Association for Theoretical Computer Science, 93:220--, October 2007. Technical Contributions.

[Markey, 2003]

N. Markey. Temporal logic with past is exponentially more succinct. Bulletin of the European Association for Theoretical Computer Science, 79:122--, February 2003. Columns: Concurrency.

[Martín-Vide and Mateescu, 2000]

C. Martín-Vide and A. Mateescu. Contextual Generalized Sequential Machines. Bulletin of the European Association for Theoretical Computer Science, 72:159--, October 2000. Columns: Formal Language Theory.

[Martín-Vide and Paun, 2000]

C. Martín-Vide and G. Paun. Computing with Membranes: One More Collapsing Hierarchy. Bulletin of the European Association for Theoretical Computer Science, 72:183--, October 2000. Technical Contributions.

[Martín-Vide and Paun, 2001]

C. Martín-Vide and G. Paun. Language Generating by Means of Membrane Systems. Bulletin of the European Association for Theoretical Computer Science, 75:199--, October 2001. Columns: Formal Language Theory.

[Martín-Vide et al., 1998]

Carlos Martín-Vide, Alexandru Mateescu, and Gheorghe Paun. Hybrid Grammars: The Chomsky-Marcus Case. Bulletin of the European Association for Theoretical Computer Science, 64:159-165, February 1998. Technical Contributions.

[Martín-Vide et al., 2002]

C. Martín-Vide, A. Paun, and G. Paun. Membrane Computing: New Results, New Problems. Bulletin of the European Association for Theoretical Computer Science, 78:204--, October 2002. Columns: Formal Language Theory.

[Marx, 2006]

M. Marx. Navigation in XML trees. Bulletin of the European Association for Theoretical Computer Science, 88:126-140, February 2006. Columns: Logic in Computer Science.

[Marxen and Buntrock, 1990]

H. Marxen and J. Buntrock. Attacking the Busy Beaver 5. Bulletin of the European Association for Theoretical Computer Science, 40:247-251, February 1990. Technical Contributions.

[Mateescu and Salomaa, 1996]

A. Mateescu and A. Salomaa. Views on Linguistics. Bulletin of the European Association for Theoretical Computer Science, 58:148-154, February 1996. Columns: Formal Language Theory.

[Mateescu and Salomaa, 1999]

A. Mateescu and A. Salomaa. Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring. Bulletin of the European Association for Theoretical Computer Science, 68:134--, June 1999. Columns: Formal Language Theory.

[Mateescu, 1993]

A. Mateescu. The Splendour of an Old Ballad: Aad van Wijngaarden Grammars. Bulletin of the European Association for Theoretical Computer Science, 49:130-142, February 1993. Columns: Formal Language Theory.

[Mateescu, 1998]

A. Mateescu. Words on Trajectories. Bulletin of the European Association for Theoretical Computer Science, 65:118--, June 1998. Columns: Formal Language Theory.

[Maung, 1993]

I. Maung. On Specialization HIerarchies of Mutable Objects. Bulletin of the European Association for Theoretical Computer Science, 49:165-174, February 1993. Technical Contributions.

[Mavronicolas, 2000]

M. Mavronicolas. Annotated Bibliography on Counting Networks. Bulletin of the European Association for Theoretical Computer Science, 72:123--, October 2000. Columns: Distributed Computing.

[Mavronicolas, 2001a]

M. Mavronicolas. Distributed Computing Theory to Date (Part I: Models and an Example). Bulletin of the European Association for Theoretical Computer Science, 73:99--, February 2001. Columns: Distributed Computing.

[Mavronicolas, 2001b]

M. Mavronicolas. Stability in Routing: Networks and Protocols. Bulletin of the European Association for Theoretical Computer Science, 74:119--, June 2001. Columns: Distributed Computing.

[Mavronikolas, 2010]

M. Mavronikolas. Some Algorithmic Questions About Nash Equilibria. Bulletin of the European Association for Theoretical Computer Science, 100:35--, February 2010. Columns: Algorithmic Game Theory.

[Meduna, 1995]

A. Meduna. A trivial method of characterizing the family of recursively enumerable languages by scattered context grammars. Bulletin of the European Association for Theoretical Computer Science, 56, June 1995. Technical Contributions.

[Meinel and Theobald, 1998]

Christoph Meinel and Thorsten Theobald. Ordered Binary Decision Diagrams and Their Significance in Computer-Aided Design of VLSI Circuits. Bulletin of the European Association for Theoretical Computer Science, 64:171-187, February 1998. Surveys and Tutorials.

[Meinel, 1992]

C. Meinel. Branching Programs - An Efficient Data Structure for Computer-Aided Circuit Design. Bulletin of the European Association for Theoretical Computer Science, 46:149-170, February 1992. Technical Contributions.

[Melchisedech et al., 1996]

R. Melchisedech, M. Deininger, A. Drappa, H. Hoff, S. Krauss, J. Li, J. Ludewig, and P. Mandl-Striegnitz. SESAM - A Software Engineering Education Tool Based on Graph Grammars. Bulletin of the European Association for Theoretical Computer Science, 58:198-221, February 1996. Educational Matters.

[Meyer et al., 1991a]

J.J.-Ch. Meyer, W. van der Hoek, and G.A.W. Vreeswijk. Epistemic Logic for Computer Science: A Tutorial (part one). Bulletin of the European Association for Theoretical Computer Science, 44:242-270, June 1991. Surveys and Tutorials.

[Meyer et al., 1991b]

J.J.-Ch. Meyer, W. van der Hoek, and G.A.W. Vreeswijk. Epistemic Logic for Computer Science: A Tutorial (part two). Bulletin of the European Association for Theoretical Computer Science, 45:256-287, October 1991. Surveys and Tutorials.

[Meyer, 1980]

A.R. Meyer. Ten thousand and one logics of programming. Bulletin of the European Association for Theoretical Computer Science, 10:11-29, January 1980. Technical Contributions.

[Meyer, 1981]

J.-J. Ch. Meyer. A note on Arnold-Karpinski's seven equations bound for data specifications. Bulletin of the European Association for Theoretical Computer Science, 13:42-44, February 1981. Technical Contributions.

[Meyer, 1987a]

J.-J. Ch. Meyer. Process Modalities Obtained as Fixed Points (part one). Bulletin of the European Association for Theoretical Computer Science, 32:98-107, June 1987. Technical Contributions.

[Meyer, 1987b]

J.-J. Ch. Meyer. Process Modalities Obtained as Fixed Points (part two). Bulletin of the European Association for Theoretical Computer Science, 33:71-82, October 1987. Technical Contributions.

[Mihalache and Salomaa, 1997]

Valeria Mihalache and Arto Salomaa. Lindenmayer and DNA: Watson-Crick D0L Systems. Bulletin of the European Association for Theoretical Computer Science, 62:160-175, June 1997. Columns: Formal Language Theory.

[Mihalache, 1997]

Valeria Mihalache. Accepting Cooperating Distributed Grammar Systems with Terminal Derivation. Bulletin of the European Association for Theoretical Computer Science, 61:80-84, February 1997. Technical Contributions.

[Miller, 2008]

D. Miller. Formalizing operational semantic specifications in logic. Bulletin of the European Association for Theoretical Computer Science, 96:58--, October 2008. Columns: Concurrency.

[Milner and Moller, 1990]

R. Milner and F. Moller. Unique decomposition of processes. Bulletin of the European Association for Theoretical Computer Science, 41:226-232, June 1990. Technical Contributions.

[Mitchell, 2005]

D.G. Mitchell. A SAT Solver Primer. Bulletin of the European Association for Theoretical Computer Science, 85:112-133, February 2005. Columns: Logic in Computer Science.

[Mitrana, 1992]

V. Mitrana. Valence grammars on a free generated group. Bulletin of the European Association for Theoretical Computer Science, 47:174-179, June 1992. Technical Contributions.

[Mitrana, 1993]

V. Mitrana. Some Remarks on Paun-Salomaa Sequences. Bulletin of the European Association for Theoretical Computer Science, 49:175-177, February 1993. Technical Contributions.

[Mitrana, 1996]

V. Mitrana. Distributed Catenation Versus Shuffle. Bulletin of the European Association for Theoretical Computer Science, 58:163-167, February 1996. Technical Contributions.

[Mitrana, 1997]

Victor Mitrana. Some Remarks on Morphisms and Primitivity. Bulletin of the European Association for Theoretical Computer Science, 62:213-216, June 1997. Technical Contributions.

[Monroe, 2008]

H. Monroe. Are there natural problems with speedup? Bulletin of the European Association for Theoretical Computer Science, 94:212--, February 2008. Technical Contributions.

[Morales-Bueno et al., 2000]

R. Morales-Bueno, L. Fortes, Ll. Mora, and F. Triguero. Two Classical Theorems Revisited. Bulletin of the European Association for Theoretical Computer Science, 71:204--, June 2000. Educational Matters.

[Moshkov, 1995]

M. Moshkov. Relationships between depth of deterministic and nondeterministic acyclic programs computing functions of k-valued logic. Bulletin of the European Association for Theoretical Computer Science, 56, June 1995. Technical Contributions.

[Moss, 2006]

L. Moss. Recursion Theorems and Self-Replication via Text Register Machine Programs. Bulletin of the European Association for Theoretical Computer Science, 89:171, June 2006. Technical Contributions.

[Mosses, 1996]

Peter D. Mosses. CoFI: The Common Framework Initiative for Algebraic Specification. Bulletin of the European Association for Theoretical Computer Science, 59:127-132, June 1996. Columns: Algebraic Specification.

[Muchnik, 1992]

A.A. Muchnik. Games on infinite trees and automata with dead-ends: a new proof for the decidability of the monadic second order theory of two successors. Bulletin of the European Association for Theoretical Computer Science, 48:220-267, October 1992. Surveys and Tutorials.

[Murphy, 1991]

D. Murphy. The Physics of Observation: a Perspective for Concurrency Theorists. Bulletin of the European Association for Theoretical Computer Science, 44:192-200, June 1991. Technical Contributions.

[Nagl, 1980]

M. Nagl. 1980 Bibliography on graph rewriting systems (graph-grammars). Bulletin of the European Association for Theoretical Computer Science, 12:13-45, October 1980. Technical Contributions.

[Nagl, 1983]

M. Nagl. Bibliography on Graph Rewriting Systems (Graph-Grammars). Bulletin of the European Association for Theoretical Computer Science, 20:114-148, June 1983. Technical Contributions.

[Nagy, 2004]

B. Nagy. The Languages of SAT and n-SAT over Finitely Many Variables are Regular. Bulletin of the European Association for Theoretical Computer Science, 82:286-297, February 2004. Technical Contributions.

[Nake, 1998]

F. Nake. Loving Teaching. Bulletin of the European Association for Theoretical Computer Science, 65:150--, June 1998. Educational Matters.

[Nasser, 2003]

R. Readi Nasser. A Note on First Order Unification. Bulletin of the European Association for Theoretical Computer Science, 81:271-278, October 2003. Technical Contributions.

[Navarro et al., 1993]

M. Navarro, F. Orejas, and A. Sanchez. Characterizing Confusion. Bulletin of the European Association for Theoretical Computer Science, 49:104-109, February 1993. Columns: Algebraic Specification.

[Nestmann and Victor, 1998]

Uwe Nestmann and Björn Victor. Calculi for Mobile Processes - Bibliography and Web Pages. Bulletin of the European Association for Theoretical Computer Science, 64:139-144, February 1998. Columns: Concurrency.

[Nielsen, 1993]

M. Nielsen. The Concurrency Column. Bulletin of the European Association for Theoretical Computer Science, 50:182-185, June 1993. Columns: Concurrency.

[Nielson, 1986]

F. Nielson. A bibliography on abstract interpretation. Bulletin of the European Association for Theoretical Computer Science, 28:45-52, February 1986. Bibliographies.

[Niemi, 1991]

V. Niemi. Density in discrete systems. Bulletin of the European Association for Theoretical Computer Science, 44:168-175, June 1991. Columns: Formal Language Theory.

[Nijholt, 1982]

Anton Nijholt. An Annotated Bibliography of Pumping. Bulletin of the European Association for Theoretical Computer Science, 17:34-53, June 1982. Technical Contributions.

[Nikoletsas and Spirakis, 2004]

S. Nikoletsas and P. Spirakis. The Characteristic Algorithmic Approach for Ad-hoc Mobile Networks. Bulletin of the European Association for Theoretical Computer Science, 82:126-169, February 2004. Columns: Distributed Computing.

[Nirmal and Rama, 1989]

Nalinakshi Nirmal and R. Rama. Note on (E0L-E0L) Array Systems. Bulletin of the European Association for Theoretical Computer Science, 37:152-160, February 1989. Technical Contributions.

[Nirmal and Rama, 1990]

N. Nirmal and R. Rama. Note on (EOL-EOL) array systems. Bulletin of the European Association for Theoretical Computer Science, 41:233-239, June 1990. Technical Contributions.

[Nirmal et al., 1986]

N. Nirmal, R. Rama, and C. Sri Hari Nagore. Closure properties of E0L-regular matrix lamguages. Bulletin of the European Association for Theoretical Computer Science, 30:102, October 1986. Technical Contributions.

[Nivat and Podelski, 1989]

Maurice Nivat and Andreas Podelski. Definite Tree Languages (cont'd). Bulletin of the European Association for Theoretical Computer Science, 38:186-190, June 1989. Technical Contributions.

[Nivat and Saoudi, 1988]

M. Nivat and A Saoudi. Automata on Infinite Trees and Kleene Closure of Regular Tree Sets. Bulletin of the European Association for Theoretical Computer Science, 36:131-136, October 1988. Technical Contributions.

[Nivat, 1985]

Maurice Nivat. Theory and practice in software engineering. Bulletin of the European Association for Theoretical Computer Science, 27:260-261, October 1985. Miscellaneous.

[Nivat, 2002]

M. Nivat. EATCS Award Acceptance Speech. Bulletin of the European Association for Theoretical Computer Science, 78:213--, October 2002. Reflections.

[Nourani, 1981]

Farshid Nourani. On induction for programming logic: Syntax, semantics, and inductive closure. Bulletin of the European Association for Theoretical Computer Science, 13:51-64, February 1981. Technical Contributions.

[Nourani, 1994]

C.F. Nourani. Types, Induction, and Incompleteness. Bulletin of the European Association for Theoretical Computer Science, 53:226-247, June 1994. Technical Contributions.

[Nourani, 1995]

Cyrus F. Nourani. Artificial Algebras. Bulletin of the European Association for Theoretical Computer Science, 57:215-218, October 1995. Technical Contributions.

[Nygaard, 2002]

K. Nygaard. Ole-Johan Dahl, Obituary. Bulletin of the European Association for Theoretical Computer Science, 78:323--, October 2002. Miscellaneous.

[Ochmanski, 1985]

E. Ochmanski. Regular behaviour of concurrent systems. Bulletin of the European Association for Theoretical Computer Science, 27:56-67, October 1985. Technical Contributions.

[Ochmanski, 1987]

Edward Ochmanski. A Non-Invertible PCP Language. Bulletin of the European Association for Theoretical Computer Science, 33:83-84, October 1987. Technical Contributions.

[Ochmanski, 1989]

Edward Ochmanski. Semi-Commutation for Place/Transition Systems. Bulletin of the European Association for Theoretical Computer Science, 38:191-198, June 1989. Technical Contributions.

[Ochmanski, 1990]

E. Ochmanski. Notes on a star mystery. Bulletin of the European Association for Theoretical Computer Science, 40:252-257, February 1990. Technical Contributions.

[Ó'Dúnlaing and Yap, 1984]

C. Ó'Dúnlaing and C.K. Yap. Counting digraphs and hypergraphs. Bulletin of the European Association for Theoretical Computer Science, 24:85-88, October 1984. Technical Contributions.

[Ohlebusch, 1993a]

E. Ohlebusch. A simple proof of sufficient conditions for the termination of the disjoint union of term rewriting systems. Bulletin of the European Association for Theoretical Computer Science, 50:223-228, June 1993. Technical Contributions.

[Ohlebusch, 1993b]

E. Ohlebusch. A Simple Proof of Sufficient Conditions for the Termination of the Disjoint Union of Term Rewriting Systems. Bulletin of the European Association for Theoretical Computer Science, 49:178-183, February 1993. Technical Contributions.

[Ohlebusch, 1998]

E. Ohlebusch. Modularity of Termination for Disjoint Term Graph Rewrite Systems: A Simple Proof. Bulletin of the European Association for Theoretical Computer Science, 66:171-177, October 1998. Technical Contributions.

[Okhotin, 2003]

A. Okhotin. An overview of conjunctive grammars. Bulletin of the European Association for Theoretical Computer Science, 79:145--, February 2003. Columns: Formal Language Theory.

[Okhotin, 2007]

A. Okhotin. Nine open problems on conjunctive and boolean grammars. Bulletin of the European Association for Theoretical Computer Science, 91:96, February 2007. Columns: Formal Language Theory.

[Olderog, 1986a]

E.-R. Olderog. Semantics of concurrent processes: the search for structure and abstraction Part I. Bulletin of the European Association for Theoretical Computer Science, 28:73-97, February 1986. Surveys and tutorials.

[Olderog, 1986b]

E.R. Olderog. Semantics of concurrent processes: the search for structure and abstraction, Part II. Bulletin of the European Association for Theoretical Computer Science, 29:96-117, June 1986. Surveys and Tutorials.

[Olivié and Paredaens, 1979]

H. Olivié and J. Paredaens. On the Relationship Between Son-Trees and Symmetric Binary B-Trees. Bulletin of the European Association for Theoretical Computer Science, 9:45-46, October 1979. Technical Contributions.

[Olivié, 1980]

H. Olivié. On random son-trees (abstract). Bulletin of the European Association for Theoretical Computer Science, 10:61, January 1980. Technical Contributions.

[Ollongren, 1989]

Alexander Ollongren. A Curious Grammar. Bulletin of the European Association for Theoretical Computer Science, 39:189-196, October 1989. Technical Contributions.

[Ottmann et al., 1985]

T. Ottmann, M. Schrapp, and D. Wood. Weight-balanced trees are not stratisfied. Bulletin of the European Association for Theoretical Computer Science, 25:24-31, February 1985. Technical Contributions.

[Ottmann, 1978]

Th. Ottmann. On log(n) Solutions of the Dictionary Problem for one-sided height-balanced binary search trees. Bulletin of the European Association for Theoretical Computer Science, 4:20-25, January 1978. Technical Contributions.

[Otto, 1998]

Friedrich Otto. Disjointness of Congruences generated by Finite Monadic String-Rewriting Systems that are Confluent is Undecidable in General. Bulletin of the European Association for Theoretical Computer Science, 64:342-348, February 1998. Problems and Solutions.

[Overmars and Welzl, 1985]

M.H. Overmars and E. Welzl. A simple method for solving 2-dimensional static range searching. Bulletin of the European Association for Theoretical Computer Science, 25:31-33, February 1985. Technical Contributions.

[Overmars et al., 1989]

Mark Overmars, Bertha Scholten, and Ingrid Vincent. Sets without Empty Convex 6-Gons. Bulletin of the European Association for Theoretical Computer Science, 37:160-168, February 1989. Technical Contributions.

[Overmars, 1981]

Mark H. Overmars. Reporting and counting intersections of arcs on a circle. Bulletin of the European Association for Theoretical Computer Science, 14:7-15, June 1981. Technical Contributions.

[Overmars, 1982]

Mark H. Overmars. A O(1) Average Time Update Scheme for Balanced Search Trees. Bulletin of the European Association for Theoretical Computer Science, 18:27-29, October 1982. Technical Contributions.

[Padawitz and Wirsing, 1984]

P. Padawitz and M. Wirsing. Completeness of many-sorted equational logic revisited. Bulletin of the European Association for Theoretical Computer Science, 24:88-94, October 1984. Technical Contributions.

[Padawitz, 1988]

Peter Padawitz. Can Inductive Proofs be Automated. Bulletin of the European Association for Theoretical Computer Science, 35:163-170, June 1988. Technical Contributions.

[Padawitz, 1989]

Peter Padawitz. Can Inductive Proofs be Automated? Part II. Bulletin of the European Association for Theoretical Computer Science, 37:168-174, February 1989. Technical Contributions.

[Padberg et al., 2007]

J. Padberg, H. Ehrig, and K. Hoffman. Formal modelling and analysis of flexible processes in mobile ad-hoc networks. Bulletin of the European Association for Theoretical Computer Science, 91:120, February 2007. Columns: Formal Specification.

[Padberg, 1993]

J. Padberg. Algebraic high-level net transformation systems: a survey over theory and applications. Bulletin of the European Association for Theoretical Computer Science, 51:102-110, October 1993. Columns: Algebraic Specification.

[Padberg, 1998]

J. Padberg. Classification of Petri Nets Using Adjoint Functors. Bulletin of the European Association for Theoretical Computer Science, 66:85-91, October 1998. Columns: Formal Specification.

[Padberg, 2005]

Julia Padberg. Integration of the Generic Component Concepts for System Modeling with Adhesive HLR Systems. Bulletin of the European Association for Theoretical Computer Science, 87:138-154, October 2005. Columns: Formal Specification.

[Pagnoni, 1996]

A. Pagnoni. Detecting and Correcting Operation Errors of Distributed Systems. Bulletin of the European Association for Theoretical Computer Science, 58:168-186, February 1996. Technical Contributions.

[Palamidessi and Valencia, 2006]

C. Palamidessi and F. Valencia. Languages for Concurrency. Bulletin of the European Association for Theoretical Computer Science, 90:155-171, October 2006. Columns: Programming Languages.

[Palamidessi, 2005]

Catuscia Palamidessi. Recursion vs Replication in Process Calculi: Expressiveness. Bulletin of the European Association for Theoretical Computer Science, 87:105-125, October 2005. Columns: Concurrency.

[Panangaden, 1996]

P. Panangaden. Does Concurrency Theory Have Anything To Say About Parallel Programming? Bulletin of the European Association for Theoretical Computer Science, 58:140-147, February 1996. Columns: Concurrency.

[Panangaden, 2001]

P. Panangaden. Does Combining Nondeterminism and Probability Make Sense? Bulletin of the European Association for Theoretical Computer Science, 75:182--, October 2001. Columns: Concurrency.

[Pansiot, 1985]

Jean-Jacques Pansiot. Subword complexities and iteration. Bulletin of the European Association for Theoretical Computer Science, 26:55-62, June 1985. Technical Contributions.

[Papadimitriou and Knuth, 1981]

Christos H. Papadimitriou and Donald E. Knuth. Duality in addition chains. Bulletin of the European Association for Theoretical Computer Science, 13:2-4, February 1981. Technical Contributions.

[Papadimitriou, 1985]

Christos H. Papadimitriou. A note on the expressive power of Prolog. Bulletin of the European Association for Theoretical Computer Science, 26:21-23, June 1985. Technical Contributions.

[Papadopoulou, 2006]

V. Papadopoulou. A Game on a Distributed Network. Bulletin of the European Association for Theoretical Computer Science, 89:97, June 2006. Columns: Distributed Computing.

[Parberry, 1989]

Ian Parberry. How to Present a Paper in Theoretical Computer Science: A Speaker's Guide for Students. Bulletin of the European Association for Theoretical Computer Science, 37:344-349, February 1989. reprinted from SIGACT News, Vol. 19, No. 2, pp. 42-47, 1988.

[Paredaens, 1978]

J. Paredaens. On a formal description of constraints in a data base scheme. Bulletin of the European Association for Theoretical Computer Science, 6:36-40, October 1978. Technical Contributions.

[Paredaens, 1987a]

J. Paredaens. On database models - summary of a panel discussion. Bulletin of the European Association for Theoretical Computer Science, 31:123-124, February 1987. Columns: Theory of Databases.

[Paredaens, 1987b]

Jan Paredaens. ( Object Oriented Systems ). Bulletin of the European Association for Theoretical Computer Science, 33:40-41, October 1987. Columns: Database Theory.

[Parikh, 1991]

R. Parikh. Dumb-Founded Sets. Bulletin of the European Association for Theoretical Computer Science, 43:183-184, February 1991. Technical Contributions.

[Parisi-Presicce, 1981]

Francesco Parisi-Presicce. A note on the reduction of systems of fixed point equations. Bulletin of the European Association for Theoretical Computer Science, 13:37-41, February 1981. Technical Contributions.

[Parisi-Presicce, 1983]

Francesco Parisi-Presicce. A Remark on Iterative Congruences. Bulletin of the European Association for Theoretical Computer Science, 20:148-152, June 1983. Technical Contributions.

[Parnas, 1993]

D.L. Parnas. Mathematics of computation for (software and other) engineers. Bulletin of the European Association for Theoretical Computer Science, 51:249-259, October 1993. Educational Matters.

[Parrow, 1995]

J. Parrow. Concurrency without Homotopy. Bulletin of the European Association for Theoretical Computer Science, 55:140-143, February 1995. Columns: Concurrency.

[Paterson, 1981]

Mike Paterson. A note on Park's problem. Bulletin of the European Association for Theoretical Computer Science, 15:55-56, October 1981. Technical Contributions.

[Paterson, 1982]

M. Paterson. A Solution to P8 (Number 17, June 1982). Bulletin of the European Association for Theoretical Computer Science, 18:29, October 1982. Technical Contributions.

[Paun, 1985]

G. Paun. On Parikh-boundedness of matrix languages. Bulletin of the European Association for Theoretical Computer Science, 25:34-37, February 1985. Technical Contributions.

[Paun, 1996a]

G. Paun. Open problems. Bulletin of the European Association for Theoretical Computer Science, 58:351-352, February 1996. Problems and Solutions.

[Paun, 1996b]

Gheorghe Paun. Computing by Splicing: How Simple Rules? Bulletin of the European Association for Theoretical Computer Science, 60:145-150, October 1996. Technical Contributions.

[Paun, 1999a]

A. Paun. On Time-Varying H Systems. Bulletin of the European Association for Theoretical Computer Science, 67:157-164, February 1999. Technical Contributions.

[Paun, 1999b]

G. Paun. Computing with Membranes: A Correction, Two Problems, and Some Bibliographical Remarks. Bulletin of the European Association for Theoretical Computer Science, 69:141-144, October 1999. Technical Contributions.

[Paun, 1999c]

G. Paun. Computing with Membranes: An Introduction. Bulletin of the European Association for Theoretical Computer Science, 67:139-152, February 1999. Columns: Formal Language Theory.

[Paun, 2004]

G. Paun. Membrane Computing after the Second Brainstorming Week Sevilla, Februari 2004. Bulletin of the European Association for Theoretical Computer Science, 83:159-170, June 2004. Columns: Natural Computing.

[Paun, 2007]

G. Paun. Spiking neural P systems: a tutorial. Bulletin of the European Association for Theoretical Computer Science, 91:145, February 2007. Columns: Natural Computing.

[Pawlak, 1984]

Z. Pawlak. On rough sets. Bulletin of the European Association for Theoretical Computer Science, 24:94-109, October 1984. Technical Contributions.

[Pawlak, 1987]

Zdzislaw Pawlak. Decision Tables - A Rough Set Approach. Bulletin of the European Association for Theoretical Computer Science, 33:85-95, October 1987. Technical Contributions.

[Pawlak, 1989]

Zdzislaw Pawlak. Knowledge, Reasoning and Classification - A Rough Set Perspective. Bulletin of the European Association for Theoretical Computer Science, 38:199-210, June 1989. Technical Contributions.

[Pawlak, 1991]

Z. Pawlak. Decision Logic. Bulletin of the European Association for Theoretical Computer Science, 44:201-225, June 1991. Technical Contributions.

[Pawlak, 1992]

Z. Pawlak. Concurrent versus sequential - the rough sets perspective. Bulletin of the European Association for Theoretical Computer Science, 48:178-190, October 1992. Technical Contributions.

[Pawlak, 1993]

Z. Pawlak. Anatomy of conflicts. Bulletin of the European Association for Theoretical Computer Science, 50:234-247, June 1993. Technical Contributions.

[Penttonen, 1978a]

M. Penttonen. The equivalence for realtime strict DPDA's is still open. Bulletin of the European Association for Theoretical Computer Science, 5:14, June 1978. Technical Contributions.

[Penttonen, 1978b]

Martti Penttonen. The Decidability of the Equivalence Problem for Realtime Strict Deterministic Pushdown Automata. Bulletin of the European Association for Theoretical Computer Science, 4:26-29, January 1978. Technical Contributions.

[Pérez, 2010]

J.A. Pérez. Higher-Order Concurrency: Expressiveness and Decidability Results - A Survey. Bulletin of the European Association for Theoretical Computer Science, 101:92-124, June 2010. Columns: Concurrency.

[Perrin and Schützenberger, 1978]

D. Perrin and M.P. Schützenberger. A conjecture of differences of integer pairs. Bulletin of the European Association for Theoretical Computer Science, 5:27-29, June 1978. Technical Contributions.

[Perrin, 1985]

D. Perrin. On the solution of Ehrenfeucht's conjecture. Bulletin of the European Association for Theoretical Computer Science, 27:68-70, October 1985. Technical Contributions.

[Perrin, 1996]

Dominique Perrin. Obituary on M.-P. Schützenberger. Bulletin of the European Association for Theoretical Computer Science, 60:314-316, October 1996.

[Petersen, 1997]

Holger Petersen. An Answer to a Question of Bodlaender and de Fluiter. Bulletin of the European Association for Theoretical Computer Science, 63:260, October 1997. Problems and Solutions.

[Petre, 1999]

I. Petre. A Normal form for P-Systems. Bulletin of the European Association for Theoretical Computer Science, 67:165-172, February 1999. Technical Contributions.

[Piirainen, 2004]

V. Piirainen. Monotone Algebras, R-Trivial Monoids and a Variety of Tree Languages. Bulletin of the European Association for Theoretical Computer Science, 84:189-194, October 2004. Technical Contributions.

[Pin, 1994]

J.-E. Pin. Logic on Words. Bulletin of the European Association for Theoretical Computer Science, 54:145-165, October 1994. Columns: Logic in Computer Science.

[Pisanti, 1998]

Nadia Pisanti. DNA Computing: A Survey. Bulletin of the European Association for Theoretical Computer Science, 64:171-187, February 1998. Surveys and Tutorials.

[Plotkin et al., 2010]

G. Plotkin, C. Stirling, M. Tofte, and 12-16. Obituary: Robin Milner (1934-2010) PDF. Bulletin of the European Association for Theoretical Computer Science, 101, June 2010.

[Poigné, 1981]

Axel Poigné. A note on Z-sets being crossed up and down. Bulletin of the European Association for Theoretical Computer Science, 13:21-24, February 1981. Technical Contributions.

[Poigné, 1987]

Axel Poigné. A remark on variations of power domains. Bulletin of the European Association for Theoretical Computer Science, 31:38-42, February 1987. Technical Contributions.

[Poigné, 1989]

Axel Poigné. Bisimulation as Cointersection. Bulletin of the European Association for Theoretical Computer Science, 39:197-198, October 1989. Technical Contributions.

[Porrot et al., 1997]

Sylvain Porrot, Max Dauchet, and Denis Pomorski. The Fractal Dimension of a Computable Figure is the Average Normalized Complexity of its Points. Bulletin of the European Association for Theoretical Computer Science, 62:216-221, June 1997. Technical Contributions.

[Prandi et al., 2005]

D. Prandi, C. Priami, and P. Quanglia. Process Calculi in a Biological Context. Bulletin of the European Association for Theoretical Computer Science, 85:53-69, February 2005. Columns: Concurrency.

[Presicce and Pierantonio, 1991]

F. Parisi Presicce and A. Pierantonio. Towards the Algebraic Specification of Classes in Object Oriented Programming. Bulletin of the European Association for Theoretical Computer Science, 45:86-97, October 1991. Columns: Algebraic Specification.

[Price and Wotschke, 1978]

J.K. Price and D. Wotschke. The triple construction for converting a PDA into a CFG is sometimes optimal. Bulletin of the European Association for Theoretical Computer Science, 5:4-5, June 1978. Technical Contributions.

[Priese, 1988]

Lutz Priese. Fairness. Bulletin of the European Association for Theoretical Computer Science, 35:171-180, June 1988. Technical Contributions.

[Priese, 1993]

L. Priese. Fairness, part II. Bulletin of the European Association for Theoretical Computer Science, 50:247-259, June 1993. Technical Contributions.

[Printz, 1993]

J. Printz. Mathematical training for the software developers: a practical experience. Bulletin of the European Association for Theoretical Computer Science, 51:260-264, October 1993. Educational Matters.

[Printz, 1994]

J. Printz. Mathematical Training for the Software Developers: A Practical Experience. Bulletin of the European Association for Theoretical Computer Science, 52:335-373, February 1994. Educational Matters.

[Prodinger, 1979]

Helmut Prodinger. A Remark concerning the Solution of a Linear Recurrence. Bulletin of the European Association for Theoretical Computer Science, 9:13, October 1979. Technical Contributions.

[Prodinger, 1992]

H. Prodinger. Some analytic techniques for the investigation of the asymptotic behaviour of tree parameters. Bulletin of the European Association for Theoretical Computer Science, 47:180-199, June 1992. Technical Contributions.

[Prodinger, 1994a]

H. Prodinger. Knuth's Old Sum - A Survey. Bulletin of the European Association for Theoretical Computer Science, 54:232-245, October 1994. Surveys and Tutorials.

[Prodinger, 1994b]

H. Prodinger. Some Polynomials Related to the Fibonacci Polynomials. Bulletin of the European Association for Theoretical Computer Science, 53:248-250, June 1994. Technical Contributions.

[Prodinger, 1995]

H. Prodinger. Digital search trees and basic hypergeometric functions. Bulletin of the European Association for Theoretical Computer Science, 56, June 1995. Technical Contributions.

[Pudlák and Springsteel, 1976]

P. Pudlák and F. Springsteel. Complexity of mechanized hypothesis formation (abstract). Bulletin of the European Association for Theoretical Computer Science, 2:15-18, December 1976. Short Research Notes.

[Paun and Salomaa, 1992]

G. Paun and A. Salomaa. Decision Problems Concerning the Thinness of DOL Languages. Bulletin of the European Association for Theoretical Computer Science, 46:171-181, February 1992. Technical Contributions.

[Paun and Thierrin, 1997]

Gheorghe Paun and Gabriel Thierrin. Morphisms and Primitivity. Bulletin of the European Association for Theoretical Computer Science, 61:85-88, February 1997. Technical Contributions.

[Paun, 1983]

Gheorghe Paun. A Positive Answer to Problem P11: There are inherently ambiguous context-free languages that have inherently ambiguous context-free complements. Bulletin of the European Association for Theoretical Computer Science, 19:9-10, February 1983. Technical Contributions.

[Paun, 1988]

Gheorghe Paun. On Langford-Lyndon-Thue Sequences. Bulletin of the European Association for Theoretical Computer Science, 34:63-67, February 1988. Technical Contributions.

[Paun, 1990]

G. Paun. Non-centralized parallel communicating grammar systems. Bulletin of the European Association for Theoretical Computer Science, 40:257-264, February 1990. Technical Contributions.

[Paun, 1991]

G. Paun. A Characterization of Recursively Enumerable Languages. Bulletin of the European Association for Theoretical Computer Science, 45:218-222, October 1991. Technical Contributions.

[Paun, 1992]

G. Paun. VALENCES: Increasing the power of grammars, transducers, grammar systems. Bulletin of the European Association for Theoretical Computer Science, 48:143-156, October 1992. Formal Language Theory.

[Paun, 1993a]

G. Paun. How much Thue is Kolakovski? Bulletin of the European Association for Theoretical Computer Science, 49:183-185, February 1993. Technical Contributions.

[Paun, 1993b]

G. Paun. Remarks concerning self-reading sequences. Bulletin of the European Association for Theoretical Computer Science, 50:229-233, June 1993. Technical Contributions.

[Paun, 1994]

G. Paun. Marcus Contextual Grammars: After twenty five years. Bulletin of the European Association for Theoretical Computer Science, 52:263-273, February 1994. Columns: Formal Language Theory.

[Paun, 1995]

Gheorghe Paun. Splicing. Bulletin of the European Association for Theoretical Computer Science, 57:183-194, October 1995. Columns: Formal Language Theory.

[Qemali, 2002]

A. Qemali. A New Experience with Graph Transformation. Bulletin of the European Association for Theoretical Computer Science, 77:63--, June 2002. Columns: Formal Specification.

[Quaglia, 1999]

P. Quaglia. The Pi-Calculus: Notes on Labelled Semantics. Bulletin of the European Association for Theoretical Computer Science, 68:104--, June 1999. Columns: Concurrency.

[Rabinovich, 1987]

Alexander Rabinovich. Pomset Semantics is Consistent with Data flow Semantics. Bulletin of the European Association for Theoretical Computer Science, 32:107-117, June 1987. Technical Contributions.

[Radhakrishnan, 2002]

J. Radhakrishnan. Primes in P. Bulletin of the European Association for Theoretical Computer Science, 78:61--, October 2002. News from India.

[Rahonis, 1998]

George Rahonis. On Teaching Elements of Theoretical Computer Science in Greek Secondary Education. Bulletin of the European Association for Theoretical Computer Science, 64:188-216, February 1998. Educational Matters.

[Rampersad, 2008]

N. Rampersad. Avoiding sufficiently large binary patterns. Bulletin of the European Association for Theoretical Computer Science, 95:241--, June 2008. Technical Contributions.

[Raoult, 1983]

Jean-Claude Raoult. On Graph Rewritings. Bulletin of the European Association for Theoretical Computer Science, 21:39-49, October 1983. Technical Contributions.

[Raspaud, 1993]

A. Raspaud. Good and semi-strong colorings of oriented planar graphs. Bulletin of the European Association for Theoretical Computer Science, 50:260-263, June 1993. Technical Contributions.

[Rathke and Sobocinski, 2009]

J. Rathke and P. Sobocinski. Deriving Labelled Transition Systems - A Structural Approach. Bulletin of the European Association for Theoretical Computer Science, 98:107--, June 2009. Columns: Concurrency.

[Rauff, 2000]

J.V. Rauff. The Joys of Teaching Formal Language Theory to Children. Bulletin of the European Association for Theoretical Computer Science, 72:189--, October 2000. Educational Matters.

[Raulefs et al., 1978]

P. Raulefs, J. Siekman, P. Szabó, and E. Unvericht. A short survey on the state of the art in matching and unification problems. Bulletin of the European Association for Theoretical Computer Science, 6:9-24, October 1978. Technical Contributions.

[Raz, 1978]

Yoav Raz. 1L Systems with Bounded Interactions. Bulletin of the European Association for Theoretical Computer Science, 4:13-19, January 1978. Technical Contributions.

[Raz, 1995]

Danny Raz. Context-free Languages are not Closed under interior and frontier. Bulletin of the European Association for Theoretical Computer Science, 57:219-221, October 1995. Technical Contributions.

[Regan, 2002]

K.W. Regan. Understanding the Mulmuley-Sohoni Approach to P vs. NP. Bulletin of the European Association for Theoretical Computer Science, 78:86--, October 2002. Columns: Computational Complexity.

[Reichel, 1996]

Horst Reichel. Unifying ADT - and Evolving Algebra Specifications. Bulletin of the European Association for Theoretical Computer Science, 59:112-126, June 1996. Columns: Algebraic Specification.

[Reisig, 1988]

Wolfgang Reisig. Concurrency is More Fundamental Than Interleaving. Bulletin of the European Association for Theoretical Computer Science, 35:181-185, June 1988. Technical Contributions.

[Reisig, 1993]

W. Reisig. Petri Nets: Fundamentals, Essentials, Consequences. Bulletin of the European Association for Theoretical Computer Science, 49:185-191, February 1993. Technical Contributions.

[Rensink, 1993]

A. Rensink. Order isomorphism does not preserve global event independence. Bulletin of the European Association for Theoretical Computer Science, 51:228-235, October 1993. Technical Contributions.

[Renvall, 1992]

A. Renvall. ANDOS: A simple protocol for secret selling of secrets. Bulletin of the European Association for Theoretical Computer Science, 47:200-205, June 1992. Technical Contributions.

[Restivo and Salemi, 1983]

Antonio Restivo and Sergio Salemi. On Weakly Square Free Words. Bulletin of the European Association for Theoretical Computer Science, 21:49-56, October 1983. Technical Contributions.

[Reusch, 1979]

Bernd Reusch. An Open Problem Concerning Non-Determinism. Bulletin of the European Association for Theoretical Computer Science, 9:9-10, October 1979. Technical Contributions.

[Reutenauer, 1981]

Christophe Reutenauer. On a problem. Bulletin of the European Association for Theoretical Computer Science, 14:15-16, June 1981. Technical Contributions.

[Ricci, 1990]

G. Ricci. Most definitions of trees over an alphabet are wrong. Bulletin of the European Association for Theoretical Computer Science, 40:265, February 1990. Technical Contributions.

[Richomme, 1999]

G. Richomme. Another Characterization of Sturmian Words (one more). Bulletin of the European Association for Theoretical Computer Science, 67:173-175, February 1999. Technical Contributions.

[Richomme, 2007]

G. Richomme. Sudo-Lyndon. Bulletin of the European Association for Theoretical Computer Science, 92:143-149, June 2007. Technical Contributions.

[Riegel et al., 2009]

T. Riegel, P. Felber, and C. Fetzer. Composable Error Recovery With Transactional Memory. Bulletin of the European Association for Theoretical Computer Science, 99:105--, October 2009. Columns: Distributed Computing.

[Rigo and Waxweiler, 2006]

M. Rigo and L. Waxweiler. A note on syndeticity, recognizable sets, and Cobham's theorem. Bulletin of the European Association for Theoretical Computer Science, 88:169-173, February 2006. Technical Contributions.

[Rodríguez-Patón, 2001]

A. Rodríguez-Patón. On the Universality of P Systems with Membrane Creation. Bulletin of the European Association for Theoretical Computer Science, 74:229--, June 2001. Technical Contributions.

[Rosaz, 2003]

L. Rosaz. Puzzle Corner. Bulletin of the European Association for Theoretical Computer Science, 79:288--, February 2003. Puzzle Corner.

[Rosenberg, 1985a]

A.L. Rosenberg. References to the literature on VLSI algorithms and related mathematical and practical issues. Bulletin of the European Association for Theoretical Computer Science, 25:42-63, February 1985. Bibliographies.

[Rosenberg, 1985b]

Arnold L. Rosenberg. Challenges and opportunities in VLSI theory. Bulletin of the European Association for Theoretical Computer Science, 26:69-100, June 1985. Surveys and Tutorials.

[Rosenblum et al., 1989]

Leonid Rosenblum, Alexandre Yakovlev, and Vladimit Yakovlev. A Look at Concurrency Semantics Through 'Lattice Glasses'. Bulletin of the European Association for Theoretical Computer Science, 37:175-180, February 1989. Technical Contributions.

[Rote, 2002]

G. Rote. Crossing the Bridge at Night. Bulletin of the European Association for Theoretical Computer Science, 78:241--, October 2002. Technical Contributions.

[Rozenberg and Salomaa, 1990]

G. Rozenberg and A. Salomaa. Aristid Lindenmayer in Memoriam. Bulletin of the European Association for Theoretical Computer Science, 40:509-510, February 1990.

[Rozenberg and Salomaa, 2005]

G. Rozenberg and A. Salomaa. Seymour Ginsburg (1928-2004) An Obituary. Bulletin of the European Association for Theoretical Computer Science, 86:234-235, June 2005. Obituary.

[Rozenberg et al., 1981]

G. Rozenberg, J. Mäenpää, and A. Salomaa. Supplementary bibliography of L-systems. Bulletin of the European Association for Theoretical Computer Science, 13:64-79, February 1981. Technical Contributions.

[Rozenberg, 2005]

G. Rozenberg. Computer Science, Informatics, and Natural Computing. Bulletin of the European Association for Theoretical Computer Science, 85:133-134, February 2005. Columns: Natural Computing.

[Sakakibara, 2005]

Yasubumi Sakakibara. Development of a Bacteria Computer: From in silico Finite Automata to in vitro and in vivo. Bulletin of the European Association for Theoretical Computer Science, 87:165-178, October 2005. Columns: Natural Computing.

[Salomaa and Santean, 1990]

A. Salomaa and L. Santean. Secret Selling of Secrets with Several Buyers. Bulletin of the European Association for Theoretical Computer Science, 42:178-186, October 1990. Technical Contributions.

[Salomaa and Yu, 1993]

K. Salomaa and S. Yu. Limited nondeterminism for pushdown automata. Bulletin of the European Association for Theoretical Computer Science, 50:186-193, June 1993. Columns: Formal Language Theory.

[Salomaa et al., 1991]

A. Salomaa, K. Salomaa, and S. Yu. Primality Types of Instances of the Post Correspondence Problem. Bulletin of the European Association for Theoretical Computer Science, 44:226-241, June 1991. Technical Contributions.

[Salomaa, 1978]

Arto Salomaa. D0L Equivalence: the problem of iterated morphism. Bulletin of the European Association for Theoretical Computer Science, 4:5-12, January 1978. Technical Contributions.

[Salomaa, 1979]

Arto Salomaa. DOL Language Equivalence. Bulletin of the European Association for Theoretical Computer Science, 8:4-12, June 1979. Technical Contributions.

[Salomaa, 1981]

A. Salomaa. What computer scientists should know about SAUNA. Bulletin of the European Association for Theoretical Computer Science, 15:8-21, October 1981. Special Features Technical Contributions.

[Salomaa, 1985a]

A. Salomaa. The Ehrenfeucht conjecture: a proof for language theorists. Bulletin of the European Association for Theoretical Computer Science, 27:71-82, October 1985. Technical Contributions.

[Salomaa, 1985b]

Arto Salomaa. Cryptography from Caesar to DES and RSA. Bulletin of the European Association for Theoretical Computer Science, 26:101-120, June 1985. Surveys and Tutorials.

[Salomaa, 1986]

A. Salomaa. Scattered recollections about EATCS. Bulletin of the European Association for Theoretical Computer Science, 30:3-6, October 1986.

[Salomaa, 1987a]

Arto Salomaa. Playfair. Bulletin of the European Association for Theoretical Computer Science, 33:42-53, October 1987. Columns: Formal Languages.

[Salomaa, 1987b]

Arto Salomaa. Two-Way Thue. Bulletin of the European Association for Theoretical Computer Science, 32:82-86, June 1987. Columns: Formal Languages.

[Salomaa, 1988a]

Arto Salomaa. Cryptographic Transductions. Bulletin of the European Association for Theoretical Computer Science, 36:85-95, October 1988. Columns: Formal Language Theory.

[Salomaa, 1988b]

Arto Salomaa. Cryptography and Natural Languages. Bulletin of the European Association for Theoretical Computer Science, 35:92-96, June 1988. Columns: Formal language Theory.

[Salomaa, 1989]

Arto Salomaa. Knapsacks and Superdogs. Bulletin of the European Association for Theoretical Computer Science, 38:107-123, June 1989. Columns: Formal Language Theory.

[Salomaa, 1990]

A. Salomaa. Decidability in finite automata. Bulletin of the European Association for Theoretical Computer Science, 41:175-183, June 1990. Columns: Formal Language Theory.

[Salomaa, 1991]

A. Salomaa. L Codes and L Systems with Immigration. Bulletin of the European Association for Theoretical Computer Science, 43:124-130, February 1991. Columns: Formal Language Theory.

[Salomaa, 1992]

A. Salomaa. What Emil said about the Post correspondence problem. Bulletin of the European Association for Theoretical Computer Science, 47:154-165, June 1992. Columns: Formal Language Theory.

[Salomaa, 1994]

A. Salomaa. Patterns. Bulletin of the European Association for Theoretical Computer Science, 54:194-206, October 1994. Columns: Formal Language Theory.

[Salomaa, 1995a]

A. Salomaa. From Parikh vectors to GO territories. Bulletin of the European Association for Theoretical Computer Science, 56, June 1995. Columns: Formal Language Theory.

[Salomaa, 1995b]

A. Salomaa. Return to Patterns. Bulletin of the European Association for Theoretical Computer Science, 55:144-157, February 1995. Columns: Formal Language Theory.

[Salomaa, 1996]

Arto Salomaa. Conjugate Words, Cuts of the Deck and Cryptographic Protocols. Bulletin of the European Association for Theoretical Computer Science, 59:137-149, June 1996. Columns: Formal Language Theory.

[Salomaa, 1997]

Arto Salomaa. Conjugate Words, Cuts of the Deck and Cryptographic Protocols. Bulletin of the European Association for Theoretical Computer Science, 61:59-71, February 1997. Columns: Formal Language Theory.

[Salomaa, 2000a]

A. Salomaa. Automata: Glimpses from Past and Present. Bulletin of the European Association for Theoretical Computer Science, 70:148-155, February 2000. Reflections.

[Salomaa, 2000b]

A. Salomaa. Depth of Functional Compositions. Bulletin of the European Association for Theoretical Computer Science, 71:143--, June 2000. Columns: Formal Language Theory.

[Salomaa, 2003]

A. Salomaa. Counting (Scattered) Subwords. Bulletin of the European Association for Theoretical Computer Science, 81:165-179, October 2003. Columns: Formal Language Theory.

[Sanders, 2004]

P. Sanders. Algorithms for Memory Hierarchies. Bulletin of the European Association for Theoretical Computer Science, 83:67-85, June 2004. Columns: Algorithmics.

[Sanella and Tarlecki, 1990]

D. Sanella and A. Tarlecki. Algebraic specification and formal methods for program development: what are the real problems? Bulletin of the European Association for Theoretical Computer Science, 41:134-137, June 1990. Columns: Algebraic Specification.

[Santean, 1990]

L. Santean. Parallel Communicating Systems. Bulletin of the European Association for Theoretical Computer Science, 42:160-171, October 1990. Columns: Formal Language Theory.

[Sassone, 2000]

V. Sassone. On the Algebraic Structure of Petri Nets. Bulletin of the European Association for Theoretical Computer Science, 72:133--, October 2000. Columns: Concurrency.

[Savage, 1999]

J.E. Savage. A New Approach to the First Theory Course. Bulletin of the European Association for Theoretical Computer Science, 67:190-194, February 1999. Educational Matters.

[Saxena, 2009]

N. Saxena. Progress on Polynomial Identity Testing. Bulletin of the European Association for Theoretical Computer Science, 99:49--, October 2009. Columns: Complexity.

[Scedrow, 1990]

A. Scedrow. A brief guide to linear logic. Bulletin of the European Association for Theoretical Computer Science, 41:154-165, June 1990. Columns: Logic in Computer Science.

[Scheideler, 2008]

C. Scheideler. Algorithms for overlay networks. Bulletin of the European Association for Theoretical Computer Science, 95:130--, June 2008. Columns: Distributed Computing.

[Schirmer and Kreinovich, 1996]

Douglas Schirmer and Vladik Kreinovich. Towards a More Realistic Definition of Feasibility. Bulletin of the European Association for Theoretical Computer Science, 60:151-153, October 1996. Technical Contributions.

[Schmeck, 9979]

Hartmut Schmeck. A Note on Extending the Notion of Finite Index. Bulletin of the European Association for Theoretical Computer Science, 9:34-40, october 1 9979. Technical Contributions.

[Schmidt-Schauß, 1988a]

Manfred Schmidt-Schauß. Solution to Problem P140 and P141 (Unification Theory). Bulletin of the European Association for Theoretical Computer Science, 34:274-275, February 1988. Problems and Solutions.

[Schmidt-Schauß, 1988b]

Manfred Schmidt-Schauß. Two Problems in Unification Theory. Bulletin of the European Association for Theoretical Computer Science, 34:273, February 1988. Problems and Solutions.

[Schmidt, 1983]

Diana Schmidt. An Alternative Definition of NP. Bulletin of the European Association for Theoretical Computer Science, 21:57-67, October 1983. Technical Contributions.

[Schmidt, 1999]

M. Schmidt. Time-Bounded Kolmogorov Complexity May Help in Search for Extra Terrestrial Intelligence (SETI). Bulletin of the European Association for Theoretical Computer Science, 67:176-180, February 1999. Technical Contributions.

[Schneider, 2001]

H.J. Schneider. Computability in an Introductory Course on Programming. Bulletin of the European Association for Theoretical Computer Science, 73:153--, February 2001. Educational Matters.

[Schneider, 2004]

H.J. Schneider. Introducing the parallel Random Access Machine together with FORTARN 90/95. Bulletin of the European Association for Theoretical Computer Science, 82, February 2004. Education Matters.

[Schnoebelen, 1999]

Ph. Schnoebelen. Decomposable regular languages and the shuffle operator. Bulletin of the European Association for Theoretical Computer Science, 67:283-289, February 1999. Problems and Solutions.

[Schönhage, 1986]

A. Schönhage. Tapes versus pointers, a study in implementing fast algorithms. Bulletin of the European Association for Theoretical Computer Science, 30:23-32, October 1986.

[Schöning and von Knop, 2010]

U. Schöning and M. von Knop. Using Stochastic Indexed Grammars for RNA Structure Prediction With Pseudoknots. Bulletin of the European Association for Theoretical Computer Science, 101:185-188, June 2010. Technical Contributions.

[Schöning, 1981]

Uwe Schöning. Complete sets for the second level of the log-space hierarchy. Bulletin of the European Association for Theoretical Computer Science, 14:3-5, June 1981. Technical Contributions.

[Schöning, 2000]

U. Schöning. Mastering the Master Theorem. Bulletin of the European Association for Theoretical Computer Science, 71:165--, June 2000. Technical Contributions.

[Schulz, 1978]

H.D. Schulz. Garden of Eden-Configurations. Bulletin of the European Association for Theoretical Computer Science, 5:6-14, June 1978. Technical Contributions.

[Schwill, 1994]

A. Schwill. Fundamental Ideas of Computer Science. Bulletin of the European Association for Theoretical Computer Science, 53:274-295, June 1994. Educational Matters.

[Scollo, 1993]

G. Scollo. Algebra in the New UT Informatica. Bulletin of the European Association for Theoretical Computer Science, 49:205-209, February 1993. Educational Matters.

[Seda, 1994a]

A.K. Seda. Some Applications of General Topology to the Semantics of Logic Programs. Bulletin of the European Association for Theoretical Computer Science, 52:279-292, February 1994. Technical Contributions.

[Seda, 1994b]

A.K. Seda. Topological View of the Kowalski - van Emden Theorem. Bulletin of the European Association for Theoretical Computer Science, 53:256-263, June 1994. Technical Contributions.

[Seda, 1996]

Anthony Karel Seda. Quasi-Metrics and Fixed Points in Computing. Bulletin of the European Association for Theoretical Computer Science, 60:154-163, October 1996. Technical Contributions.

[Seebold, 1988a]

Patrice Seebold. An Effective Solution to the D0L Periodicity Problem in the Binary Case. Bulletin of the European Association for Theoretical Computer Science, 36:137-151, October 1988. Technical Contributions.

[Séébold, 1988b]

Patrice Séébold. Solutions of three Problems about Morphisms generating Infinite Words. Bulletin of the European Association for Theoretical Computer Science, 34:275-284, February 1988. Problems and Solutions.

[Seljée, 1994]

R. Seljée. Integrity Constraint Checking for Updates in Deductive Databases; a different approach. Bulletin of the European Association for Theoretical Computer Science, 52:292-314, February 1994. Technical Contributions.

[Selman, 1991]

A.L. Selman. Complexity Classes for Partial Functions. Bulletin of the European Association for Theoretical Computer Science, 45:114-130, October 1991. Columns: Structural Complexity.

[Sempere, 2004]

J.M. Sempere. A Representation Theorem for Languages Accepted by Watson-Crick Finite Automata. Bulletin of the European Association for Theoretical Computer Science, 83:187-191, June 2004. Technical Contributions.

[Serna and Thilikos, 2005]

M. Serna and D.M. Thilikos. Parameterized complexity for graph layout problems. Bulletin of the European Association for Theoretical Computer Science, 86:41--, June 2005. Columns: Algorithmics.

[Sestoft, 1987]

P. Sestoft. Partial evaluation bibliography. Bulletin of the European Association for Theoretical Computer Science, 31:50-54, February 1987. Bibliographies.

[Sevenster, 2001]

A. Sevenster. Recent Elsevier Science Publishing Policies. Bulletin of the European Association for Theoretical Computer Science, 75:301--, October 2001. Miscellaneous.

[Sevenster, 2006]

M. Sevenster. Henkin Quantifiers: Logic, Games, and Computation. Bulletin of the European Association for Theoretical Computer Science, 89:136, June 2006. Columns: Logic in Computer Science.

[Shafer et al., 2010]

G. Shafer, V. Vovk, and R. Chychyla. How to Base Probability Theory on Perfect-Information Games. Bulletin of the European Association for Theoretical Computer Science, 100:115--, February 2010. Columns: Logics in Computer Science.

[Shallit and Wilson, 1992]

J. Shallit and D. Wilson. The ``3x +1'' Problem and Finite Automata. Bulletin of the European Association for Theoretical Computer Science, 46:182-185, February 1992. Technical Contributions.

[Shaltiel, 2002]

R. Shaltiel. Recent Developments in Explicit Constructions of Extractors. Bulletin of the European Association for Theoretical Computer Science, 77:67--, June 2002. Columns: Computational Complexity.

[Sherstov, 2008]

A. Sherstov. Communication lower bounds using dual polynomials. Bulletin of the European Association for Theoretical Computer Science, 95:59--, June 2008. Columns: Complexity.

[Shilov and Yi, 2001]

N.V. Shilov and K. Yi. How to Find a Coin: Propositional Program Logics Made Easy. Bulletin of the European Association for Theoretical Computer Science, 75:127--, October 2001. Columns: Logic in Computer Science.

[Siefkes et al., 1985]

Dirk Siefkes, Paul Young, and Leonard Lipshitz. Obituary of J.R. Büchi, 1924-1984. Bulletin of the European Association for Theoretical Computer Science, 25:197-198, February 1985.

[Siefkes, 1984]

Dirk Siefkes. Obituary of J.R. Büchi. Bulletin of the European Association for Theoretical Computer Science, 24:234, October 1984.

[Siegelmann, 2001]

H.T. Siegelmann. Neural Computing. Bulletin of the European Association for Theoretical Computer Science, 73:107--, February 2001. Columns: Natural Computing Column Neural Computing.

[Sifakis, 1983]

Joseph Sifakis. A Note on Deadlocks in CA-Systems. Bulletin of the European Association for Theoretical Computer Science, 20:153-159, June 1983. Technical Contributions.

[Silva, 2002]

P.V. Silva. Recognizable subsets of a group: finite extensions and the abelian case. Bulletin of the European Association for Theoretical Computer Science, 77:195--, June 2002. Technical Contributions.

[Siromoney and Das, 2003]

R. Siromoney and B. Das. DNA algorithm for breaking a propositional logic based cryptosystem. Bulletin of the European Association for Theoretical Computer Science, 79:170--, February 2003. Technical Contributions.

[Siromoney and Siromoney, 1986]

R. Siromoney and G. Siromoney. A public key cryptosystem that defies cryptoanalysis. Bulletin of the European Association for Theoretical Computer Science, 28:37-43, February 1986. Technical Contributions.

[Siromoney and Subramanian, 1983]

Rani Siromoney and K. G. Subramanian. Generative Grammar for the Cube-Free Abbey Floor. Bulletin of the European Association for Theoretical Computer Science, 20:160-162, June 1983. Technical Contributions.

[Skowron and Suraj, 1993]

A. Skowron and Z. Suraj. A rough set approach to real-time state identification. Bulletin of the European Association for Theoretical Computer Science, 50:264-275, June 1993. Technical Contributions.

[Skowron, 1989]

A. Skowron. The Evidence Theory and Decision Tables. Bulletin of the European Association for Theoretical Computer Science, 39:199-204, October 1989. Technical Contributions.

[Skyum, 1983]

Sven Skyum. A Solution to P12 (number 18, October 1982). Bulletin of the European Association for Theoretical Computer Science, 19:34-37, February 1983. Technical Contributions.

[Sloane, 2000]

N.J.A. Sloane. Announcement on On-Line Encyclopedia of Integer Sequences. Bulletin of the European Association for Theoretical Computer Science, 70:296, February 2000.

[Smith, 1996]

Einar Smith. A Survey on High-Level Petri-Net Theory. Bulletin of the European Association for Theoretical Computer Science, 59:267-293, June 1996. Surveys and Tutorials.

[Sobocinski, 2004]

P. Sobocinski. Process Congruences from Reaction Rules. Bulletin of the European Association for Theoretical Computer Science, 84:102-127, October 2004. Columns: Concurrency.

[Socher-Ambrosius, 1990]

R. Socher-Ambrosius. Another Technique for Proving Completeness of Ground Resolution. Bulletin of the European Association for Theoretical Computer Science, 42:187-189, October 1990. Technical Contributions.

[Sofronie, 1989]

Viorica Sofronie. Formula-Handling Computer Solution of Boolean Equations. I. Ring Equations. Bulletin of the European Association for Theoretical Computer Science, 37:182-186, February 1989. Technical Contributions.

[Sokolowski, 1987]

Stefan Sokolowski. How not to sweep infixes under the carpet. Bulletin of the European Association for Theoretical Computer Science, 31:42-47, February 1987. Technical Contributions.

[Spaan et al., 1989]

Edith Spaan, Leen Torenvliet, and Peter van Emde Boas. Nondeterminism, Fairness and a Fundamental Analogy. Bulletin of the European Association for Theoretical Computer Science, 37:186-193, February 1989. Technical Contributions.

[Speckmann, 2007]

B. Speckmann. Algorithmic aspects of cartogram computation. Bulletin of the European Association for Theoretical Computer Science, 92:33-43, June 2007.

[Spencer, 1991]

D. Spencer. A Survey of Categorical Computation: Fixed Points, Partiality, Combinators ... Control? Bulletin of the European Association for Theoretical Computer Science, 43:285-312, February 1991. Surveys and Tutorials.

[Springsteel and Pudlák, 1978]

F.N. Springsteel and Pavel Pudlák. Intermediate complexity in data matrix problems. Bulletin of the European Association for Theoretical Computer Science, 6:33-35, October 1978. Technical Contributions.

[Srba, 2002]

J. Srba. Roadmap of Infinite Results. Bulletin of the European Association for Theoretical Computer Science, 78:163--, October 2002. Columns: Concurrency.

[Srinivasan, 2000]

A. Srinivasan. Low-Discrepancy Sets For High-Dimensional Rectangles: A Survey. Bulletin of the European Association for Theoretical Computer Science, 70:67-76, February 2000. Columns: Computational Complexity.

[Staiger and Yamasaki, 2002]

L. Staiger and H. Yamasaki. A Simple Example of an omega -Language Topologically. Bulletin of the European Association for Theoretical Computer Science, 78:247--, October 2002. Technical Contributions.

[Staiger, 1998]

L. Staiger. The Hausdorff Measure of Regular omega -languages is Computable. Bulletin of the European Association for Theoretical Computer Science, 66:178-182, October 1998. Technical Contributions.

[Staiger, 2007]

L. Staiger. On maximal prefix codes. Bulletin of the European Association for Theoretical Computer Science, 91:205, February 2007. Technical Contributions.

[Stamatiou, 2003]

Y.C. Stamatiou. Threshold Phenomena: The computer Scientist's Viewpoint. Bulletin of the European Association for Theoretical Computer Science, 80:199--, June 2003. Surveys and Tutorials.

[Staples, 1979]

John Staples. Dynamics of Discrete Structures. Bulletin of the European Association for Theoretical Computer Science, 8:2-3, June 1979. Technical Contributions.

[Starke, 1980]

Peter H. Starke. Remarks on Reusch's nondeterminism problem. Bulletin of the European Association for Theoretical Computer Science, 10:40-48, January 1980. Technical Contributions.

[Starke, 1981]

Peter H. Starke. A note on conflicts in Petri nets. Bulletin of the European Association for Theoretical Computer Science, 14:26-33, June 1981. Technical Contributions.

[Starke, 1983]

Peter H. Starke. Monogenous Fifo-Nets and Petri-Nets are Equivalent. Bulletin of the European Association for Theoretical Computer Science, 21:68-77, October 1983. Technical Contributions.

[Stay, 2004]

M. Stay. Inexpensive Linear-Optical Implementations of Deutsch's Algorithm. Bulletin of the European Association for Theoretical Computer Science, 84:195-200, October 2004. Technical Contributions.

[Steacy, 1996]

Robert Steacy. Structure in the Kolakoski Sequence. Bulletin of the European Association for Theoretical Computer Science, 59:173-182, June 1996. Technical Contributions.

[Steinbach, 1994]

J. Steinbach. A Formalism for Representing Orderings. Bulletin of the European Association for Theoretical Computer Science, 53:254-263, June 1994. Technical Contributions.

[Steinby and Thomas, 2000]

M. Steinby and W. Thomas. Trees and Term Rewriting in 1910: On a Paper by Axel Thue. Bulletin of the European Association for Theoretical Computer Science, 72:256--, October 2000. Historical Comments.

[Steinby, 1992]

M. Steinby. On generalizations of the Nerode and Myhill theorems. Bulletin of the European Association for Theoretical Computer Science, 48:191-196, October 1992. Technical Contributions.

[Stewart, 1990]

I.A. Stewart. On the Graph Accessibility Problem for Directed Graphs of Bounded Degree. Bulletin of the European Association for Theoretical Computer Science, 42:190-193, October 1990. Technical Contributions.

[Stewart, 1991]

I.A. Stewart. Obtaining Nielsen Reduced Sets in Free Groups. Bulletin of the European Association for Theoretical Computer Science, 43:184-188, February 1991. Technical Contributions.

[Stoelinga, 2002]

M. Stoelinga. An Introduction to Probabilistic Automata. Bulletin of the European Association for Theoretical Computer Science, 78:176--, October 2002. Columns: Concurrency.

[Su, 2006]

L. Sek Su. Subproblems and NP-Completeness Theory. Bulletin of the European Association for Theoretical Computer Science, 90:192-198, October 2006. Technical Contributions.

[Subbaramu et al., 1999]

S. Subbaramu, A.Q. Gates, and V. Kreinovich. Application of Kolmogorov Complexity to Image Compression: It Is Possible to Have a Better Compression, But It Is Not Possible to Have the Best One. Bulletin of the European Association for Theoretical Computer Science, 69:145-150, October 1999. Technical Contributions.

[Subramaniam and Siromoney, 2006]

G. Subramaniam and R. Siromoney. Contextual insertion for #3SAT. Bulletin of the European Association for Theoretical Computer Science, 88:174-181, February 2006. Technical Contributions.

[Subramanian, 1985]

K.G. Subramanian. Regular control on NLC grammars. Bulletin of the European Association for Theoretical Computer Science, 26:63-65, June 1985. Technical Contributions.

[Subramanian, 1992]

P.S. Subramanian. Towards an algebraic specification framework for the VLSI design process. Bulletin of the European Association for Theoretical Computer Science, 47:137-143, June 1992. Columns: Algebraic Specification.

[Sudborough, 1987]

I. Hal Sudborough. 'Cutwidth' and related graph problems. Bulletin of the European Association for Theoretical Computer Science, 31:79-110, February 1987. Surveys and Tutorials.

[Svozil, 1995a]

K. Svozil. Quantum Computation and Complexity Theory I. Bulletin of the European Association for Theoretical Computer Science, 55:170-207, February 1995. Surveys and Tutorials.

[Svozil, 1995b]

K. Svozil. Quantum Computation and Complexity Theory II. Bulletin of the European Association for Theoretical Computer Science, 56, June 1995. Surveys and Tutorials.

[Szelepcsényi, 1987]

Róbert Szelepcsényi. The Method of Forcing for Nondeterministic Automata. Bulletin of the European Association for Theoretical Computer Science, 33:96-100, October 1987. Technical Contributions.

[Szepietowski and Targan, 2004]

A. Szepietowski and M. Targan. The Counterfeit Coin Problem. Bulletin of the European Association for Theoretical Computer Science, 82:263-268, February 2004. Technical Contributions.

[Szepietowski, 1990]

A. Szepietowski. Weak mode of space complexity can be used in the proof that [DSPACE(log log n) = NSPACE(log logn)] = > [L = NL]. Bulletin of the European Association for Theoretical Computer Science, 40:266-269, February 1990. Technical Contributions.

[Szilard, 1980]

A.L. Szilard. Sixteen defenseless black knights, a challenging programming problem in computational combinatorics. Bulletin of the European Association for Theoretical Computer Science, 11:14, June 1980. Technical Contributions.

[Szpankowski, 2003]

W. Szpankowski. Analysis of Algorithms (AofA) Part II: 1998-2000 (``Princeton-Barcelona-Gdansk''). Bulletin of the European Association for Theoretical Computer Science, 80:61--, June 2003. Columns: Algorithmics.

[Taubenfeld, 2008]

G. Taubenfeld. Shared memory synchronization. Bulletin of the European Association for Theoretical Computer Science, 96:80--, October 2008. Columns: Distributed Computing.

[Tel and van Leeuwen, 1987]

Gerard Tel and Jan van Leeuwen. A Non-Deterministic Algorithm and its Analysis. Bulletin of the European Association for Theoretical Computer Science, 33:100-103, October 1987. Technical Contributions.

[Tel, 1987]

Gerard Tel. Efficient leader finding in arbitrary networks. Bulletin of the European Association for Theoretical Computer Science, 31:47-49, February 1987. Technical Contributions.

[Tesson and Thérien, 2006]

P. Tesson and D. Thérien. Bridges between algebraic automata theory and complexity theory. Bulletin of the European Association for Theoretical Computer Science, 88:37-64, February 2006. Columns: Computational Complexity.

[Thalheim, 1984]

B. Thalheim. A complete axiomatization for full join dependencies in relations. Bulletin of the European Association for Theoretical Computer Science, 24:109-115, October 1984. Technical Contributions.

[Thalheim, 1986]

B. Thalheim. A response to the note by M.Y. Vardi. Bulletin of the European Association for Theoretical Computer Science, 28:44-45, February 1986. Technical Contributions.

[Thalheim, 1990]

B. Thalheim. Open problems presented at the symposium ``Mathematical Fundamentals of Database Systems'' MFDBS-89 in Visegrad, Hungary. Bulletin of the European Association for Theoretical Computer Science, 40:492-501, February 1990. Problems and Solutions.

[Thomas, 1984]

Wolfgang Thomas. On problem P63 of M. Takahashi: omega -languages which are first-order definable in terms of prefixes. Bulletin of the European Association for Theoretical Computer Science, 24:213-216, October 1984. Problems and Solutions.

[Thomsen and Thomsen, 1998]

B. Thomsen and L. Leth Thomsen. Towards Global Computations Guided by Concurrency Theory. Bulletin of the European Association for Theoretical Computer Science, 66:92-98, October 1998. Columns: Concurrency.

[Tiusanen, 1988]

Mikko Tiusanen. Some Unsolved Problems in Modelling Self-Timed Circuits using Petri-Nets. Bulletin of the European Association for Theoretical Computer Science, 36:152-160, October 1988. Technical Contributions.

[Tomescu, 1998]

Ioan Tomescu. A Threshold Property Concerning Words Containing All Short Factors. Bulletin of the European Association for Theoretical Computer Science, 64:166-170, February 1998. Technical Contributions.

[Torán and Wagner, 2009]

J. Torán and F. Wagner. The Complexity of Planar Graph Isomorphism. Bulletin of the European Association for Theoretical Computer Science, 97:60--, February 2009. Columns: Concurrency.

[Torán, 2004]

J. Torán. Space and Width in Propositional Resolution. Bulletin of the European Association for Theoretical Computer Science, 83:86-104, June 2004. Columns: Computational Complexity.

[Traub and Wozniakowski, 1993]

J.F. Traub and H. Wozniakowski. Recent progress in information-based complexity. Bulletin of the European Association for Theoretical Computer Science, 51:141-154, October 1993. Columns: Structural Complexity.

[Trejo et al., 2000]

R.A. Trejo, V. Kreinovich, and L. Longpré. Choosing a Physical Model: Why Symmetries? Bulletin of the European Association for Theoretical Computer Science, 70:159-161, February 2000. Technical Contributions.

[Tsakalidis, 1985]

Athansios K. Tsakalidis. The nearest common ancestor in a dynamic tree. Bulletin of the European Association for Theoretical Computer Science, 26:23-31, June 1985. Technical Contributions.

[Turakainen, 1983]

Paavo Turakainen. A Machine-Oriented Approach to Compositions of Morphisms and Inverse Morphisms. Bulletin of the European Association for Theoretical Computer Science, 20:162-166, June 1983. Technical Contributions.

[Turakainen, 1985]

P. Turakainen. A note on test sets for R-rational languages. Bulletin of the European Association for Theoretical Computer Science, 25:40-42, February 1985. Technical Contributions.

[Turakainen, 1990]

P. Turakainen. On the finiteness of the multiplicative monoid generated by a nonnegative matrix. Bulletin of the European Association for Theoretical Computer Science, 40:270-272, February 1990. Technical Contributions.

[Turakainen, 1991]

P. Turakainen. A Unified Approach to Characterization of Recursively Enumerable Languages. Bulletin of the European Association for Theoretical Computer Science, 45:223-228, October 1991. Technical Contributions.

[Turakainen, 1999]

P. Turakainen. Injectivity of the Quotient h g of Two Morphisms and Ambiguity of Linear Grammars. Bulletin of the European Association for Theoretical Computer Science, 68:160--, June 1999. Technical Contributions.

[Turner, 1987]

David Turner. An Overview of Miranda. Bulletin of the European Association for Theoretical Computer Science, 33:103-114, October 1987. Technical Contributions.

[Turner, 1991]

D. Turner. Duality and De Morgan Laws for the Algebra of Lists. Bulletin of the European Association for Theoretical Computer Science, 45:229-237, October 1991. Technical Contributions.

[Urbanek, 1989]

F. Urbanek. On Minimizing Finite Automata. Bulletin of the European Association for Theoretical Computer Science, 39:205-206, October 1989. Technical Contributions.

[Urbanek, 1990]

F. Urbanek. A Simple Completeness Proof for Early's Algorithm. Bulletin of the European Association for Theoretical Computer Science, 42:194, October 1990. Technical Contributions.

[Urbanek, 1992a]

F. Urbanek. Next Star is Always. Bulletin of the European Association for Theoretical Computer Science, 46:186-187, February 1992. Technical Contributions.

[Urbanek, 1992b]

F. Urbanek. A note on the language operator ``red''. Bulletin of the European Association for Theoretical Computer Science, 47:205-206, June 1992. Technical Contributions.

[Urbanek, 1993]

F. Urbanek. A simple lambda-term representing the predecessor function with respect to church numerals. Bulletin of the European Association for Theoretical Computer Science, 50:276-279, June 1993. Technical Contributions.

[Urbásek, 2003]

M. Urbásek. Net Transformations for Petri Net Technology. Bulletin of the European Association for Theoretical Computer Science, 80:77--, June 2003. Columns: Formal Specification.

[Urquhart, 1998]

Alasdair Urquhart. The Complexity of Propositional Proofs. Bulletin of the European Association for Theoretical Computer Science, 64:128-138, February 1998. Columns: Logic in Computer Science.

[Väänänen, 1997]

Jouko Väänänen. Generalized Quantifiers. Bulletin of the European Association for Theoretical Computer Science, 62:115-136, June 1997. Columns: Logic in Computer Science.

[Vágvöglgyi and Gilleron, 1992]

S. Vágvöglgyi and R. Gilleron. For a rewrite system it is decidable whether the set of irreducible, ground terms is recognizable. Bulletin of the European Association for Theoretical Computer Science, 48:197-209, October 1992. Technical Contributions.

[Vágvölgyi, 1997]

Sándor Vágvölgyi. Erasing Writing Post Correspondence Problem. Bulletin of the European Association for Theoretical Computer Science, 63:261-262, October 1997. Problems and Solutions.

[Vágvölgyi, 1999]

S. Vágvölgyi. An Open Problem on Ground Tree Transducers and Ground Term Rewrite Systems. Bulletin of the European Association for Theoretical Computer Science, 69:225-227, October 1999. Problems and Solutions.

[Vágvölgyi, 2000]

S. Vágvölgyi. Intersection of Finitely Generated Congruences over the Term Algebra with Equal Trunks. Bulletin of the European Association for Theoretical Computer Science, 71:167--, June 2000. Technical Contributions.

[Vágvölgyi, 2004]

S. Vágvölgyi. Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite Systems. Bulletin of the European Association for Theoretical Computer Science, 82:269, February 2004. Technical Contributions.

[Vajnovszki, 1995]

Vincent Vajnovszki. Constant Time Generation of Binary Unordered Trees. Bulletin of the European Association for Theoretical Computer Science, 57:221-229, October 1995. Technical Contributions.

[Valiente, 2002]

G. Valiente. Structure of Scientific Collaboration in Graph Transformation. Bulletin of the European Association for Theoretical Computer Science, 78:329--, October 2002. Miscellaneous.

[van der Aalst, 2003]

W.M.P. van der Aalst. Challenges in Business Process Management: Verification of business processes using Petri nets. Bulletin of the European Association for Theoretical Computer Science, 80:174--, June 2003. Surveys and Tutorials.

[van Emde Boas and Karpinski, 1980]

Peter van Emde Boas and Marek Karpinski. A number theoretic problem arising from a problem in automata theory. Bulletin of the European Association for Theoretical Computer Science, 12:50-53, October 1980. Technical Contributions.

[van Emde Boas, 1980]

Peter van Emde Boas. Nondeterminism cannot be explained deterministically -- a counterexample to a problem posed by Bernd Reusch. Bulletin of the European Association for Theoretical Computer Science, 10:38-39, January 1980. Technical Contributions.

[van Glabbeek and Goltz, 1989]

Rob van Glabbeek and Ursula Goltz. Partial Orders Semantics for Refinement of Actions -- neither necessary nor always sufficient but appropriate when used with care. Bulletin of the European Association for Theoretical Computer Science, 38:154-163, June 1989. Technical Contributions.

[van Glabbeek, 1994]

R.J. van Glabbeek. What is branching time semantics and why to use it? Bulletin of the European Association for Theoretical Computer Science, 53:191-198, June 1994. Columns: Concurrency.

[van Leeuwen, 1979]

Jan van Leeuwen. Squaring a 2x2 matrix. Bulletin of the European Association for Theoretical Computer Science, 9:11-13, October 1979. Technical Contributions.

[van Leeuwen, 1981a]

Jan van Leeuwen. An elementary fact about unambiguity. Bulletin of the European Association for Theoretical Computer Science, 13:4-6, February 1981. Technical Contributions.

[van Leeuwen, 1981b]

Jan van Leeuwen. Positions of symbols in context-free derivations. Bulletin of the European Association for Theoretical Computer Science, 15:54-55, October 1981. Technical Contributions.

[van Melkebeek, 2001]

D. van Melkebeek. Time-Space Lower Bounds for Satisfiability. Bulletin of the European Association for Theoretical Computer Science, 73:57--, February 2001. Columns: Computational Complexity.

[Varacca and Völzer, 2006]

D. Varacca and H. Völzer. New Perspectives on Fairness. Bulletin of the European Association for Theoretical Computer Science, 90:90-108, October 2006. Columns: Concurrency.

[Vardi, 1985]

Moshe Y. Vardi. A response to 'A complete axiomatisation for full join dependencies in relations'. Bulletin of the European Association for Theoretical Computer Science, 26:65-67, June 1985. Technical Contributions.

[Veloso and Veloso, 1991]

P.A.S. Veloso and S.R.M. Veloso. Some Remarks on Conservative Extensions: A Socratic Dialogue. Bulletin of the European Association for Theoretical Computer Science, 43:189-198, February 1991. Technical Contributions.

[Veloso, 1992]

P.A.S. Veloso. Yet Another Cautionary Note on Conservative Extensions: a Simple Case with a Computing Flavour. Bulletin of the European Association for Theoretical Computer Science, 46:188-192, February 1992. Technical Contributions.

[Veltkamp, 2007]

R. Veltkamp. A bit of multimedia retrieval algorithms. Bulletin of the European Association for Theoretical Computer Science, 91:29, February 2007. Columns: Algorithmics.

[Vereshchagin, 2008]

N. Vereshchagin. Kolmogorov complexity and games. Bulletin of the European Association for Theoretical Computer Science, 94:43-75, February 2008. Columns: Complexity.

[Verhoeff, 1981]

Tom Verhoeff. On the compactification of programs 2. Bulletin of the European Association for Theoretical Computer Science, 15:56-59, October 1981. Technical Contributions.

[Verhoeff, 1997]

Tom Verhoeff. Some Thoughts on the Role of Competitions in Computing Science Education with a Twist in the Direction of Theoretical Computer Science. Bulletin of the European Association for Theoretical Computer Science, 63:194-196, October 1997. Educational Matters.

[Verraedt et al., 1983a]

R. Verraedt, P. De Bra, and M. Gyssens. A Solution to P11. Bulletin of the European Association for Theoretical Computer Science, 19:10-11, February 1983. Technical Contributions.

[Verraedt et al., 1983b]

R. Verraedt, P. De Bra, and M. Gyssens. A Solution to P12. Bulletin of the European Association for Theoretical Computer Science, 19:37-39, February 1983. Technical Contributions.

[Vicolov, 1993]

S. Vicolov. Infinite Hierarchies of Valence Languages. Bulletin of the European Association for Theoretical Computer Science, 49:192-194, February 1993. Technical Contributions.

[Vitányi and Meertens, 1984]

Paul M. B. Vitányi and Lambert Meertens. Big Omega versus the Wild Functions. Bulletin of the European Association for Theoretical Computer Science, 22:14-19, February 1984. Technical Contributions.

[Vitanyi, 1985]

P.M.B. Vitanyi. Logarithmic signal propagation delay and the efficiency of VLSI circuits. Bulletin of the European Association for Theoretical Computer Science, 25:37-40, February 1985. Technical Contributions.

[Volger, 1982]

H. Volger. Alternating Turing machines, bounded concatenation theories and the decision problem for first order theories: some examples. Bulletin of the European Association for Theoretical Computer Science, 16:34-36, February 1982. Technical Contributions.

[Vukolic, 2010]

M. Vukolic. The Origin of Quorum Systems. Bulletin of the European Association for Theoretical Computer Science, 101:125-147, June 2010. Columns: Distributed Computing.

[Vyskoc, 1985]

Jozef Vyskoc. Pigeon-hole principle and Boolean matrix multiplication. Bulletin of the European Association for Theoretical Computer Science, 26:67-68, June 1985. Technical Contributions.

[w. Wang, 2000]

M. w. Wang. On the Irregularity of the Duplication Closure. Bulletin of the European Association for Theoretical Computer Science, 70:162-163, February 2000. Technical Contributions.

[Wätjen, 1997]

Dietmar Wätjen. k-limited ED0L Languages Are Context-Sensitive. Bulletin of the European Association for Theoretical Computer Science, 61:89-91, February 1997. Technical Contributions.

[Wegener, 1988]

Ingo Wegener. Prime Implicants and parallel Complexity. Bulletin of the European Association for Theoretical Computer Science, 35:198-204, June 1988. Technical Contributions.

[Wegner, 1982]

L. Wegner. Is www^R Cube-Free? Bulletin of the European Association for Theoretical Computer Science, 18:120, October 1982. Problems.

[Weihrauch, 1980]

Klaus Weihrauch. Is binary notation optimal? (an open problem). Bulletin of the European Association for Theoretical Computer Science, 11:9-10, June 1980. Technical Contributions.

[Weihrauch, 1995]

Klaus Weihrauch. A Foundation of Computable Analysis. Bulletin of the European Association for Theoretical Computer Science, 57:167-182, October 1995. Columns: Structural Complexity.

[Whitty, 1990]

R. Whitty. An Exercise in Weakest Preconditions. Bulletin of the European Association for Theoretical Computer Science, 42:195-197, October 1990. Technical Contributions.

[Wiedermann, 1999]

Jiri Wiedermann. Jiri Becvar -- Obituary. Bulletin of the European Association for Theoretical Computer Science, 67:291, February 1999.

[Wiedermann, 2004]

J. Wiedermann. XXX Years of SOFSEM. Bulletin of the European Association for Theoretical Computer Science, 83:201-208, June 2004. Miscellaneous.

[Wirsing, 1986]

M. Wirsing. Algebraic specification of the abstract data type 'Continuum' without hidden operations. Bulletin of the European Association for Theoretical Computer Science, 29:46-55, June 1986. Technical Contributions.

[Woeginger, 2002]

G.J. Woeginger. Open problems in the theory of scheduling. Bulletin of the European Association for Theoretical Computer Science, 76:67-83, February 2002. Columns: Algorithmics.

[Woeginger, 2008]

G.J. Woeginger. Four non-deterministic programming exercises. Bulletin of the European Association for Theoretical Computer Science, 94:207--, February 2008. Technical Contributions.

[Wolfram, 1985]

Stephen Wolfram. Problems (on cellular automata and regular languages, P114 ). Bulletin of the European Association for Theoretical Computer Science, 26:241, June 1985. Problems and Solutions.

[Wood, 1978a]

D. Wood. Bibliography of Grammatical Similarity. Bulletin of the European Association for Theoretical Computer Science, 5:15-22, June 1978. Technical Contributions.

[Wood, 1978b]

Derick Wood. A Bibliography of Top-Down Deterministic Parsing. Bulletin of the European Association for Theoretical Computer Science, 4:30-35, January 1978. Technical Contributions.

[Wood, 1978c]

Derick Wood. PDA forms and strict interpretations. Bulletin of the European Association for Theoretical Computer Science, 6:25-28, October 1978. Technical Contributions.

[Yam, 1999]

Y. Yam. Reducing the Number of Rules in Intelligent Control: A New Application Area for Algebraic Complexity Techniques. Bulletin of the European Association for Theoretical Computer Science, 67:181-184, February 1999. Technical Contributions.

[Yu, 2000]

S. Yu. A Renaissance of Automata Theory? Bulletin of the European Association for Theoretical Computer Science, 72:270--, October 2000. Opinions.

[Yu, 2002]

S. Yu. State Complexity of Finite and Infinite Regular Languages. Bulletin of the European Association for Theoretical Computer Science, 76:142-152, February 2002. Columns: Formal Language Theory.

[Yu, 2007]

S. Yu. Cover automata for finite languages. Bulletin of the European Association for Theoretical Computer Science, 92:65-74, June 2007. Columns: Formal Language Theory.