Abstract is missing.
- Two Philosophical Applications of Algorithmic Information TheoryGregory J. Chaitin. 1-10 [doi]
- Covering and Secret Sharing with Linear CodesCunsheng Ding, Jin Yuan. 11-25 [doi]
- Combinatorial Problems Arising in SNP and Haplotype AnalysisBjarni V. Halldórsson, Vineet Bafna, Nathan Edwards, Ross Lippert, Shibu Yooseph, Sorin Istrail. 26-47 [doi]
- Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A SurveyMaurice Margenstern. 48-72 [doi]
- Generating Gray Codes in O(1) Worst-Case Time per WordTimothy Walsh. 73-88 [doi]
- Listing Vertices of Simple Polyhedra Associated with Dual LI(2) SystemsSammani D. Abdullahi, Martin E. Dyer, Les G. Proll. 89-96 [doi]
- Automatic Forcing and Genericity: On the Diagonalization Strength of Finite AutomataKlaus Ambos-Spies, Edgar Busse. 97-108 [doi]
- On the Order Dual of a Riesz SpaceMarian Alexandru Baroni. 109-117 [doi]
- A Finite Complete Set of Equations Generating GraphsSymeon Bozapalidis, Antonios Kalampakas. 118-128 [doi]
- ECO Method and the Exhaustive Generation of Convex PolyominoesAlberto Del Lungo, Andrea Frosini, Simone Rinaldi. 129-140 [doi]
- Regular Expressions with Timed DominoesCatalin Dima. 141-154 [doi]
- On Infinitary Rational Relations and Borel SetsOlivier Finkel. 155-167 [doi]
- Efficient Algorithms for Disjoint Matchings among Intervals and Related ProblemsFrédéric Gardi. 168-180 [doi]
- On Functions and RelationsAndré Große, Harald Hempel. 181-192 [doi]
- Paths Coloring Algorithms in Mesh NetworksMustapha Kchikech, Olivier Togni. 193-202 [doi]
- Finite State Strategies in One Player McNaughton GamesBakhadyr Khoussainov. 203-214 [doi]
- On Algebraic Expressions of Series-Parallel and Fibonacci GraphsMark Korenblit, Vadim E. Levit. 215-224 [doi]
- Boolean NP-Partitions and Projective ClosureSven Kosub. 225-236 [doi]
- On Unimodality of Independence Polynomials of Some Well-Covered TreesVadim E. Levit, Eugen Mandrescu. 237-256 [doi]
- A Coloring Algorithm for Finding Connected Guards in Art GalleriesVal Pinciu. 257-264 [doi]
- An Analysis of Quantified Linear ProgramsK. Subramani. 265-277 [doi]
- An Efficient Branch-and-Bound Algorithm for Finding a Maximum CliqueEtsuji Tomita, Tomokazu Seki. 278-289 [doi]
- On the Monotonic Computability of Semi-computable Real NumbersXizhong Zheng, George Barmpalias. 290-300 [doi]