default search action
28. SOFSEM 2001: Piestany, Slovak Republic
- Leszek Pacholski, Peter Ruzicka:
SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24 - December 1, 2001, Proceedings. Lecture Notes in Computer Science 2234, Springer 2001, ISBN 3-540-42912-3 - Hamideh Afsarmanesh, Ersin Cem Kaletas, Louis O. Hertzberger:
The Potential of Grid, Virtual Laboratories and Virtual Organizations for Bio-sciences. 1-9 - Bernadette Charron-Bost:
Agreement Problems in Fault-Tolerant Distributed Systems. 10-32 - William I. Grosky, Rong Zhao:
Negotiating the Semantic Gap: From Feature Maps to Semantic Landscapes. 33-52 - Sándor Jenei:
Inference in Rule-Based Systems by Interpolation and Extrapolation Revisited. 53-57 - Christos Kaklamanis:
Recent Advances in Wavelength Routing. 58-72 - Domenico Laforenza:
From Metacomputing to Grid Computing: Evolution or Revolution? 73-74 - Simon C. Lambert:
Knowledge-Based Control Systems. 75-89 - Jan van Leeuwen
, Jirí Wiedermann
Beyond the Turing Limit: Evolving Interactive Systems. 90-109 - Nicola Santoro:
Distributed Computations by Autonomous Mobile Robots. 110-115 - Anna Slobodová:
Formal Verification Methods for Industrial Hardware Design. 116-135 - Osamu Watanabe:
How Can Computer Science Contribute to Knowledge Discovery? 136-151 - Isto Aho:
On the Approximability of Interactive Knapsack Problems. 152-159 - Pablo Argón, Giorgio Delzanno, Supratik Mukhopadhyay, Andreas Podelski:
Model Checking Communication Protocols. 160-170 - Martin Beran:
Pipelined Decomposable BSP Computers. 171-180 - Richard F. Bonner, Rusins Freivalds, Maksim Kravtsev:
Quantum versus Probabilistic One-Way Finite Automata with Counter. 181-190 - Lubos Brim, Ivana Cerná, Pavel Krcál, Radek Pelánek:
How to Employ Reverse Search in Distributed Single Source Shortest Paths. 191-200 - Lubos Brim, David R. Gilbert, Jean-Marie Jacquet, Mojmír Kretínský:
Multi-agent Systems as Concurrent Constraint Processes. 201-210 - Adriano Di Pasquale, Enrico Nardelli:
ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs. 211-222 - Henning Fernau
Approximative Learning of Regular Languages. 223-232 - Rusins Freivalds, Andreas J. Winter
Quantum Finite State Transducers. 233-242 - Leo Galambos
Lemmatizer for Document Information Retrieval Systems in JAVA. 243-252 - Maciej Gebala:
The Reconstruction of Polyominoes from Approximately Orthogonal Projections. 253-260 - Prasad Jayanti, King Tan, Gregory Friedland, Amir Katz:
Bounding Lamport's Bakery Algorithm. 261-270 - András Kocsor, János Csirik:
Fast Independent Component Analysis in Kernel Feature Spaces. 271-281 - Rastislav Kralovic
On Majority Voting Games in Trees. 282-291 - Richard Královic:
Time and Space Complexity of Reversible Pebbling. 292-303 - Tomás Plachetka, Olaf Schmidt, Frank Albracht:
The HiQoS Rendering System. 304-315 - Martin Plátek:
Two-Way Restarting Automata and J-Monotonicity. 316-325 - Zdenek Sawa, Petr Jancar
P-Hardness of Equivalence Testing on Finite-State Processes. 326-335 - Vaughan R. Pratt:
Software Geography: Physical and Economic Aspects. 336-346
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-07-15 20:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: