Abstract is missing.
- An Invitation to Algorithmic Information TheoryGregory J. Chaitin. 1-23
- Discrete Isoperimetric InequalitiesFan Chung. 24-24
- N(n), v(n): Similarities and DifferencesCharles J. Colbourn, Jeffrey H. Dinitz. 25-37
- Forbidding, EnforcingAndrzej Ehrenfeucht, Grzegorz Rozenberg. 37-37
- Constructive Programming: A Personal ViewSusumu Hayashi. 38-51
- Indiscreet Applications of Discrete MathematicsPiergiorgio Odifreddi. 52-65
- A Foundation for Computable AnalysisKlaus Weihrauch. 66-89
- Quantum Electronic Devices Based on Metal-Dielectric Transition in Low-Dimensional Quantum StructuresIoannis Antoniou, Boris Pavlov, Adil Yafsayov. 90-104
- Recognizing Diameter Critical GraphsRichard P. Anstee, Lou Caccetta. 105-112
- The Hadwiger Number for the Product of Two CyclesDan Archdeacon, C. Paul Bonnington, John Pearson, Jozef Sirán. 113-120
- Proper Bounded Edge-ColoringsClaudia Bertram-Kretzberg, Hanno Lefmann, Vojtech Rödl, Beata Wysocka. 121-130
- Sharply Bounded Alternation within PStephen A. Bloch, Jonathan F. Buss, Judy Goldsmith. 131-146
- A Note on the Growth Rate of Planar GraphsNeal Brand, Margaret Morton. 147-157
- Secret Sharing Schemes Based on Room SquaresGhulam Rasool Chaudhry, Jennifer Seberry. 158-167
- Graph Classes between Parity and Distance-Hereditary GraphsSerafino Cicerone, Gabriele Di Stefano. 168-181
- Sierpinski's Gasket, 2-Groups and Graph SymmetriesMarston D. E. Conder, Cameron G. Walker. 182-186
- A New Pumping Property of Context-Free LanguagePál Dömösi, Masami Ito, Masashi Katsura, Chrystopher L. Nehaniv. 187-193
- The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1]Rodney G. Downey, Michael R. Fellows, Udayan Taylor. 194-213
- On the Logical Definability of Some Maximum Leaves ProblemsGiulia Galbiati, Angelo Morzenti, Francesco Maffioli. 214-225
- The Functional Lambda Abstraction Algebras Form a VarietyRobert Goldblatt. 226-243
- A Formalization of Anytime Constraint SatisfactionHans W. Guesgen. 244-252
- The Generating Functions of Lambda TermsRyu Hasegawa. 253-263
- Effectivity and Effective Continuity of Functions between Computable Metric SpacesPeter Hertling. 264-275
- On Shuffle Closure of Commutative Regular LanguagesBalázs Imreh, Masami Ito, Masashi Katsura. 276-288
- Combinatorial Properties of Sequences in Groups and SemiringsAndrei Kelarev. 289-298
- Categoricity and Scott FamiliesBakhadyr Khoussainov, Richard A. Shore. 299-307
- A Process Algebraic View of Linear LogicPadmanabhan Krishnan, Jane Hopkins. 308-320
- Set AutomataKlaus-Jörn Lange, Klaus Reinhardt. 321-329
- A Condition for a Normal Semicycle to Separate an Orientable 3-GraphCharles H. C. Little, Bruce van-Brunt. 330-337
- A New Proof Search Method for Linear LogicSatoshi Matsuoka. 338-350
- Computability Structures on Metric SpacesTakakazu Mori, Yoshiki Tsujii, Mariko Yasugi. 351-362
- EDTOL Structural Equivalence is DecidableKai Salomaa, Sheng Yu. 363-375
- k-Regular MatroidsCharles Semple. 376-386
- Representations versus Numberings: On Two Computability NotionsDieter Spreen. 387-401
- The Role of Kripke Semantics in Reasoning of Knowledge and TimeMouw-Ching Tjiok. 402-422