Abstract is missing.
- Towards Axiomatic Basis of Inductive InferenceJanis Barzdins, Rusins Freivalds, Carl H. Smith. 1-13 [doi]
- Approximation Algorithms for Fractional Covering and Packing Problems, and ApplicationsKlaus Jansen. 14 [doi]
- Challenges of CommutationJuhani Karhumäki. 15-23 [doi]
- Approximating Bounded Degree Instances of NP-Hard ProblemsMarek Karpinski. 24-34 [doi]
- Universal Algebra and Computer ScienceBoris I. Plotkin, Tanya Plotkin. 35-44 [doi]
- Quantum AlgorithmsUmesh V. Vazirani. 45-46 [doi]
- A Discrete Approximation and Communication Complexity Approach to the Superposition ProblemFarid M. Ablayev, Svetlana Ablayeva. 47-58 [doi]
- On Computational Power of Quantum Branching ProgramsFarid M. Ablayev, Aida Gainutdinova, Marek Karpinski. 59-70 [doi]
- Efficient Computation of Singular Moduli with Application in CryptographyHarald Baier. 71-82 [doi]
- Ambainis-Freivalds Algorithm for Measure-Once AutomataAija Berzina, Richard F. Bonner. 83-93 [doi]
- Are There Essentially Incomplete Knowledge Representation Systems?Janis Cirulis. 94-105 [doi]
- Best Increments for the Average Case of ShellsortMarcin Ciura. 106-117 [doi]
- Approximating Minimum CocolouringsFedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli. 118-125 [doi]
- Curved Edge RoutingKarlis Freivalds. 126-137 [doi]
- Time/Space Efficient Compressed Pattern MatchingLeszek Gasieniec, Igor Potapov. 138-149 [doi]
- Modelling Change with the Aid of Knowledge and TimeBernhard Heinemann. 150-161 [doi]
- If P != NP Then Some Strongly Noninvertible Functions Are InvertibleLane A. Hemaspaandra, Kari Pasanen, Jörg Rothe. 162-171 [doi]
- Prediction-Preserving Reducibility with Membership Queries on Formal LanguagesKouichi Hirata, Hiroshi Sakamoto. 172-183 [doi]
- Dense Families and Key Functions of Database Relation InstancesJouni Järvinen. 184-192 [doi]
- On the Complexity of Decidable Cases of Commutation Problem for LanguagesJuhani Karhumäki, Wojciech Plandowski, Wojciech Rytter. 193-203 [doi]
- Cones, Semi-AFPs, and AFPs of Algebraic Power SeriesWerner Kuich. 204-216 [doi]
- New Small Universal Circular Post MachinesManfred Kudlek, Yurii Rogozhin. 217-226 [doi]
- Divisibility Monoids: Presentation, Word Problem, and Rational LanguagesDietrich Kuske. 227-239 [doi]
- Concurrency in Timed AutomataRuggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini. 240-251 [doi]
- How Powerful Are Infinite Time Machines?Grégory Lafitte. 252-263 [doi]
- Equivalence Problem of Composite Class DiagramsGirts Linde. 264-274 [doi]
- Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse. 275-286 [doi]
- On the Category of Event Structures with Dense TimeNataly S. Moskaljova, Irina Virbitskaite. 287-298 [doi]
- Closure of Polynomial Time Partial Information Classes under Polynomial Time ReductionsArfst Nickelsen, Till Tantau. 299-310 [doi]
- Monte-Carlo Polynomial Versus Linear Time - The Truth-Table CaseRobert Rettinger, Rutger Verbeek. 311-322 [doi]
- Relating Automata-Theoretic Hierarchies to Complexity-Theoretic HierarchiesVictor L. Selivanov. 323-334 [doi]
- Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal VariablesTakayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara. 335-346 [doi]
- Piecewise and Local Threshold Testability of DFAA. N. Trahtman. 347-358 [doi]
- Compositional Homomorphisms of Relational StructuresMichal Walicki, Adis Hodzic, Sigurd Meldal. 359-371 [doi]
- Representation of Autonomous AutomataJanis Buls, Vaira Buza, Roberts Glaudins. 372-375 [doi]
- Quantum Reversibility and a New Model of Quantum AutomatonMassimo Pica Ciamarra. 376-379 [doi]
- Space-Efficient 1.5-Way Quantum Turing MachineAndrej Dubrovsky. 380-383 [doi]
- A Combinatorial Aggregation Algorithm for Stationary Distribution of a Large Markov ChainAnna Gambin, Piotr Pokarowski. 384-387 [doi]
- A Primitive for Proving the Security of Every Bit and About Universal Hash Functions & Hard Core BitsEike Kiltz. 388-391 [doi]
- Pythagorean Triples in Unification Theory of Nilpotent RingsRuvim Lipyanski. 392-395 [doi]
- Two-States Bilinear Intrinsically Universal Cellular AutomataNicolas Ollinger. 396-399 [doi]
- Linear Time Recognizer for Subsets of Z:::2:::Christophe Papazian, Eric Rémila. 400-403 [doi]
- Fuzzy Sets and Algorithms of Distributed Task Allocation for Cooperative AgentsTanya Plotkin. 404-407 [doi]
- On Recursively Enumerable Subsets of N and Rees Matrix Semigroups over (Z::3:: ; + )Bella V. Rozenblat. 408-411 [doi]
- Quantum Real-Time Turing MachineOksana Scegulnaja. 412-415 [doi]
- Mathematical Models and Optimal Algorithms of Dynamic Data Structure ControlAndrew V. Sokolov. 416-419 [doi]
- Linear Automata and Recognizable Subsets in Free SemiringsOlga Sokratova. 420-423 [doi]
- On Logical Method for Counting Dedekind NumbersMati Tombak, Ain Isotamm, Tõnu Tamme. 424-427 [doi]
- A General Method for Graph IsomorphismGabriel Valiente. 428-431 [doi]
- Designing PTASs for MIN-SUM Scheduling ProblemsFoto N. Afrati, Ioannis Milis. 432-444 [doi]
- On Robust Algorithms for the Maximum Weight Stable Set ProblemAndreas Brandstädt. 445-458 [doi]
- Multicasting in Optical NetworksLuisa Gargano. 459-460 [doi]
- Structured Randomized Rounding and ColoringBenjamin Doerr. 461-471 [doi]
- Optimal Online Flow Time with Resource AugmentationLeah Epstein, Rob van Stee. 472-482 [doi]
- New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall GraphsThomas Erlebach, Danica Vukadinovic. 483-494 [doi]
- On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor TasksAleksei V. Fishkin, Klaus Jansen, Lorant Porkolab. 495-507 [doi]
- Approximation Algorithms for Time-Dependent OrienteeringFedor V. Fomin, Andrzej Lingas. 508-515 [doi]
- On Complexity of Colouring Mixed HypertreesDaniel Král. 516-524 [doi]
- Combining Arithmetic and Geometric Rounding Techniques for Knapsack ProblemsMonaldo Mastrolilli. 525-534 [doi]
- The Complexity of Maximum Matroid-Greedoid IntersectionTaneli Mielikäinen, Esko Ukkonen. 535-540 [doi]