- Sprache
-
Englisch
- Identifier
-
103663972X
- Reihe
-
Technischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik (früher: Bericht / Universität Stuttgart, Fakultät Informatik); 1997,19
Thema
Zeichensatz ; Codierung
Beteiligte Personen und Organisationen
Lagally, Klaus
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:56 MEZ
Objekttyp
- Monografie
Beteiligte
- Lagally, Klaus
Ähnliche Objekte (12)
Polynomials, fragments of temporal logic and the variety DA over traces
A proof of the factorization forest theorem
Consistent update diffusion in mobile ad hoc networks
A delay analysis of tree-based reliable multicast protocols
A protocol for orphan detection and termination in mobile agent systems
The expressive power of simple logical fragments over traces
An agent based framework for the transparent distribution of computations
Model checking hierarchical structures
A comparison of mechanisms for locating mobile agents
Counterexample-guided abstraction refinement for the analysis of graph transformation systems
Complexity results for confluence problems
Space-based computing and semantics : a web service purist's point of view
Polynomials, fragments of temporal logic and the variety DA over traces
A proof of the factorization forest theorem
Consistent update diffusion in mobile ad hoc networks
A delay analysis of tree-based reliable multicast protocols
A protocol for orphan detection and termination in mobile agent systems
The expressive power of simple logical fragments over traces
An agent based framework for the transparent distribution of computations
Model checking hierarchical structures
A comparison of mechanisms for locating mobile agents
Counterexample-guided abstraction refinement for the analysis of graph transformation systems
Complexity results for confluence problems
Space-based computing and semantics : a web service purist's point of view
Polynomials, fragments of temporal logic and the variety DA over traces
A proof of the factorization forest theorem
Consistent update diffusion in mobile ad hoc networks
A delay analysis of tree-based reliable multicast protocols
A protocol for orphan detection and termination in mobile agent systems
The expressive power of simple logical fragments over traces
An agent based framework for the transparent distribution of computations
Model checking hierarchical structures
A comparison of mechanisms for locating mobile agents
Counterexample-guided abstraction refinement for the analysis of graph transformation systems
Complexity results for confluence problems