Вы здесь

Главная

теория

Связанные издания:

Spatial Information Theory: Cognitive and Computational Foundations of Geographic Information Science: Proc./ International Conference COSIT 99, Stade, Germany, August 1999
Spatial Information Theory - Foundations of Geographic Information Science: Proc./Intern. Conf., COSIT 2003, Kartause Ittingen, Switzerland, September 2003
Spatial Information Theory: Proc./International Conference COSIT 95. Semmering, Austria, September 1995
Specification of a Smart Card Operating System
Specifying Decision-Making Processes
Specifying with Defaults: Compositional Semantics
Stable Theories for Logic Programs
STACS 2000: Proc./17th Annual Symp. on Theoretical Aspects of Computer Science. Lille, France, February 2000
STACS 2001: Proc./18th Annual Symp. on Theoretical Aspects of Computer Science, Dresden, Germany, February 2001
STACS 2002: Proc./19th Annual Symp. on Theoretical Aspects of Computer Science, Antibes-Juan les Pins, France, March 2002
STACS 2003: Proc./20th Annual Symp. on Theoretical Aspects of Computer Science, Berlin, Germany, February-March 2003
STACS 2004: Proc./21st Annual Symp. on Theoretical Aspects of Computer Science, Montpellier, France, March 2004
STACS 93: Proc./10th Annual Symp. on Theoretical Aspects of Computer Science. Wurzburg, Germany, February 1993
STACS 94: Proc./11th Annual Symp. on Theoretical Aspects of Computer Science. Caen, France, February 1994
STACS 95: Proc./12th Annual Symp. on Theoretical Aspects of Computer Science. Munich, Germany, March 1995
STACS 97: Proc./14th Annual Symp. on Theoretical Aspects of Computer Science. Lubeck, Germany, February/March 1997
STACS 98: Proc./15th Annual Symp. on Theoretical Aspects of Computer Science. Paris, France, February 1998
STACS 99: Proc./16th Annual Symp. on Theoretical Aspects of Computer Science. Trier, Germany, March 1999
Steady-State Simulation of Queueing Processes: A Survey of Problems and Solutions
Stratified Default Theories
String Matching Algorithms and Automata
Strongly-Typed Theory of Structures and Behaviours
Structural Analysis of Hypertexts: Identifying Hierarchies and Useful Metrics
Structural Techniques and Performance Bounds of Stochastic Petri Net Models
Structures in Logic and Computer Science: A Selection of Essays in Honor of A.Ehrenfeucht
Stubborn Sets for Standard Properties
Student Designed Machines for a Theory of Computation Course
Survey of Closed Queueing Networks with Blocking
Syntactical Characterization of a Subset of Domain-Independent Formulas
Syntactic Categories in the Language of Mathematics
Synthesis of Net Systems
Syperfiniteness of Query Answers in Deductive Databases: An Automata-Theoretic Approach
Systems Theory and Engineering
Systemy informacyjne
Tao of Subgraph: The Data Model of the ABC Distributed Graph Storage System
TAPSOFT`93: Theory and Practice of Software Development: Proc./4th Intern. Joint Conf. CAAP/FASE. Orsay, France, April 1993
TAPSOFT 95: Theory and Practice of Software Development: Proc./6th Intern. Joint Conf. CAAP/FASE. Aarhus, Denmark, May 1995
TAPSOFT 97: Theory and Practice of Software Development: Proc./7th Intern. Joint Conf. CAAP/FASE. Lille, France, April 1997
Technical Applications of Knowledge-Based Systems
Testing can be Formal, too
Testing Equivalences for Processes
The ALF Proof Editor and Its Proof Engine
The -Calculus as a Theory in Linear Logic: Preliminary Results
The Complexity of Propositional Modal Theories and the Complexity of Consistency of Propositional Modal Theories
The Consistent Use of Names and Polymorphism in the Definition of Object Petri Nets
The Equational Theory of Fixed Points with Applications to Generalized Language Theory
The Ideal of Verified Software
The Joys of Bisimulation
The Logics of Theory Change: Proc./Workshop, Konstanz, FRG, October 1989
The Mathematical Theory of Context Free Languages