On the Approximability of Interactive Knapsack Problems
by Isto Aho
[View abstract]Model Checking for Communication Protocols
by Pablo Argon, Giorgio Delzanno, Supratik Mukhopadhyay, Andreas Podelski
[View abstract]Pipelined Decomposable BSP Computers (extended abstract)
by Martin Beran
[View abstract]Quantum versus Probabilistic One-Way Finite Automata with Counter
by Richard Bonner, Rusins Freivalds and Maksim Kravtsev
[View abstract]How to Employ Reverse Search in Distributed Single-Source Shortest Paths
by L. Brim, I. Cerna, P. Krcal and R. Pelanek
[View abstract]ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs
by Adriano Di Pasquale and Enrico Nardelli
[View abstract]Approximative Learning of Regular Languages
by Henning Fernau
[View abstract]Quantum Finite State Transducers
by Rusins Freivalds and Andreas Winter
[View abstract]Lemmatizer For Document Information Restrival Systems in JAVA
by Leo Galambos
[View abstract]The Reconstruction of Polyominoes from Approximately Orthogonal Projections
by Maciej Gebala
[View abstract]Multi-Agent Systems as Concurrent Constraint Processes
by D.Gilbert, J-M.Jacquet and M.Kretinsky
[View abstract]Bounding Lamport's Bakery Algorithm
by Prasad Jayanti, King Tan, Gregory Friedland and Amir Katz
[View abstract]Fast Independent Component Analysis in Kernel Feature Spaces
by Andras Kocsor and Janos Csirik
[View abstract]On Majority Voting Games in Trees
by Rastislav Kralovic
[View abstract]Time and Space Complexity of Reversible Pebbling
by Richard Kralovic
[View abstract]The HiQoS Rendering System
by T.Plachetka, O.Schmidt, F.Albracht
[View abstract]Two-way Restarting Automata and j-Monotonicity
by Martin Platek
[View abstract]P-hardness of Equivalence Testing on Finite-State Processes
by Zdenek Sawa and Petr Jancar
[View abstract]
