13. FCT 2001:
Riga,
Latvia
Rusins Freivalds (Ed.):
Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings.
Lecture Notes in Computer Science 2138 Springer 2001, ISBN 3-540-42487-3 BibTeX
@proceedings{DBLP:conf/fct/2001,
editor = {Rusins Freivalds},
title = {Fundamentals of Computation Theory, 13th International Symposium,
FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings},
booktitle = {FCT},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2138},
year = {2001},
isbn = {3-540-42487-3},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Papers
Regular Papers
- Farid M. Ablayev, Svetlana Ablayeva:
A Discrete Approximation and Communication Complexity Approach to the Superposition Problem.
47-58
Electronic Edition (Springer LINK) BibTeX
- Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski:
On Computational Power of Quantum Branching Programs.
59-70
Electronic Edition (Springer LINK) BibTeX
- Harald Baier:
Efficient Computation of Singular Moduli with Application in Cryptography.
71-82
Electronic Edition (Springer LINK) BibTeX
- Aija Berzina, Richard F. Bonner:
Ambainis-Freivalds' Algorithm for Measure-Once Automata.
83-93
Electronic Edition (Springer LINK) BibTeX
- Janis Cirulis:
Are There Essentially Incomplete Knowledge Representation Systems?
94-105
Electronic Edition (Springer LINK) BibTeX
- Marcin Ciura:
Best Increments for the Average Case of Shellsort.
106-117
Electronic Edition (Springer LINK) BibTeX
- Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli:
Approximating Minimum Cocolourings.
118-125
Electronic Edition (Springer LINK) BibTeX
- Karlis Freivalds:
Curved Edge Routing.
126-137
Electronic Edition (Springer LINK) BibTeX
- Leszek Gasieniec, Igor Potapov:
Time/Space Efficient Compressed Pattern Matching.
138-149
Electronic Edition (Springer LINK) BibTeX
- Bernhard Heinemann:
Modelling Change with the Aid of Knowledge and Time.
150-161
Electronic Edition (Springer LINK) BibTeX
- Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe:
If P != NP Then Some Strongly Noninvertible Functions Are Invertible.
162-171
Electronic Edition (Springer LINK) BibTeX
- Kouichi Hirata, Hiroshi Sakamoto:
Prediction-Preserving Reducibility with Membership Queries on Formal Languages.
172-183
Electronic Edition (Springer LINK) BibTeX
- Jouni Järvinen:
Dense Families and Key Functions of Database Relation Instances.
184-192
Electronic Edition (Springer LINK) BibTeX
- Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
On the Complexity of Decidable Cases of Commutation Problem for Languages.
193-203
Electronic Edition (Springer LINK) BibTeX
- Werner Kuich:
Cones, Semi-AFPs, and AFPs of Algebraic Power Series.
204-216
Electronic Edition (Springer LINK) BibTeX
- Manfred Kudlek, Yurii Rogozhin:
New Small Universal Circular Post Machines.
217-226
Electronic Edition (Springer LINK) BibTeX
- Dietrich Kuske:
Divisibility Monoids: Presentation, Word Problem, and Rational Languages.
227-239
Electronic Edition (Springer LINK) BibTeX
- Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini:
Concurrency in Timed Automata.
240-251
Electronic Edition (Springer LINK) BibTeX
- Grégory Lafitte:
How Powerful Are Infinite Time Machines?
252-263
Electronic Edition (Springer LINK) BibTeX
- Girts Linde:
Equivalence Problem of Composite Class Diagrams.
264-274
Electronic Edition (Springer LINK) BibTeX
- Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2.
275-286
Electronic Edition (Springer LINK) BibTeX
- Nataly S. Moskaljova, Irina Virbitskaite:
On the Category of Event Structures with Dense Time.
287-298
Electronic Edition (Springer LINK) BibTeX
- Arfst Nickelsen, Till Tantau:
Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions.
299-310
Electronic Edition (Springer LINK) BibTeX
- Robert Rettinger, Rutger Verbeek:
Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case.
311-322
Electronic Edition (Springer LINK) BibTeX
- Victor L. Selivanov:
Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies.
323-334
Electronic Edition (Springer LINK) BibTeX
- Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara:
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables.
335-346
Electronic Edition (Springer LINK) BibTeX
- A. N. Trahtman:
Piecewise and Local Threshold Testability of DFA.
347-358
Electronic Edition (Springer LINK) BibTeX
- Michal Walicki, Adis Hodzic, Sigurd Meldal:
Compositional Homomorphisms of Relational Structures.
359-371
Electronic Edition (Springer LINK) BibTeX
- Janis Buls, Vaira Buza, Roberts Glaudins:
Representation of Autonomous Automata.
372-375
Electronic Edition (Springer LINK) BibTeX
- Massimo Pica Ciamarra:
Quantum Reversibility and a New Model of Quantum Automaton.
376-379
Electronic Edition (Springer LINK) BibTeX
- Andrej Dubrovsky:
Space-Efficient 1.5-Way Quantum Turing Machine.
380-383
Electronic Edition (Springer LINK) BibTeX
- Anna Gambin, Piotr Pokarowski:
A Combinatorial Aggregation Algorithm for Stationary Distribution of a Large Markov Chain.
384-387
Electronic Edition (Springer LINK) BibTeX
- Eike Kiltz:
A Primitive for Proving the Security of Every Bit and About Universal Hash Functions & Hard Core Bits.
388-391
Electronic Edition (Springer LINK) BibTeX
- Ruvim Lipyanski:
Pythagorean Triples in Unification Theory of Nilpotent Rings.
392-395
Electronic Edition (Springer LINK) BibTeX
- Nicolas Ollinger:
Two-States Bilinear Intrinsically Universal Cellular Automata.
396-399
Electronic Edition (Springer LINK) BibTeX
- Christophe Papazian, Eric Rémila:
Linear Time Recognizer for Subsets of Z2.
400-403
Electronic Edition (Springer LINK) BibTeX
- Tanya Plotkin:
Fuzzy Sets and Algorithms of Distributed Task Allocation for Cooperative Agents.
404-407
Electronic Edition (Springer LINK) BibTeX
- Bella V. Rozenblat:
On Recursively Enumerable Subsets of N and Rees Matrix Semigroups over (Z3 ; + ).
408-411
Electronic Edition (Springer LINK) BibTeX
- Oksana Scegulnaja:
Quantum Real-Time Turing Machine.
412-415
Electronic Edition (Springer LINK) BibTeX
- Andrew V. Sokolov:
Mathematical Models and Optimal Algorithms of Dynamic Data Structure Control.
416-419
Electronic Edition (Springer LINK) BibTeX
- Olga Sokratova:
Linear Automata and Recognizable Subsets in Free Semirings.
420-423
Electronic Edition (Springer LINK) BibTeX
- Mati Tombak, Ain Isotamm, Tõnu Tamme:
On Logical Method for Counting Dedekind Numbers.
424-427
Electronic Edition (Springer LINK) BibTeX
- Gabriel Valiente:
A General Method for Graph Isomorphism.
428-431
Electronic Edition (Springer LINK) BibTeX
WEA Invited Papers
WEA Regular Papers
Copyright © Sat May 16 23:11:58 2009
by Michael Ley (ley@uni-trier.de)
