![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
CATS 2005: Newcastle, NSW, Australia
- Mike D. Atkinson, Frank K. H. A. Dehne:
Theory of Computing 2005, Eleventh CATS 2005, Computing: The Australasian Theory Symposium, Newcastle, NSW, Australia, January/February 2005. CRPIT 41, Australian Computer Society 2005, ISBN 1-920682-23-6 - Michael Compton:
Stenning's Protocol Implemented in UDP and Verified in Isabelle. 21-30 - Anthony H. Dekker, Bernard D. Colbert:
The Symmetry Ratio of a Network. 13-20 - Rodney G. Downey, Catherine McCartin:
Bounded Persistence Pathwidth. 51-56 - Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson:
Approximate Clustering of Fingerprint Vectors with Missing Values. 57-60 - Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba:
On Packing Squares with Resource Augmentation: Maximizing the Profit. 61-67 - Doug Goldson, Brijesh Dongol:
Concurrent Program Design in the Extended Theory of Owicki and Gries. 41-50 - David Hemer, Gregory Long, Paul A. Strooper:
Plug-in Proof Support for Formal Development Environments. 69-79 - Jan Hidders, Marlon Dumas, Wil M. P. van der Aalst, Arthur H. M. ter Hofstede, Jan Verelst:
When are two Workflows the Same? 3-11 - Marieke Huisman, Kerry Trentelman:
Factorising Temporal Specifications. 87-96 - Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi:
Minimum Cost Source Location Problem with Local 3-Vertex-Connectivity Requirements. 97-105 - Mark Lanthier, Doron Nussbaum, Tsuo-Jung Wang:
Calculating the Meeting Point of Scattered Robots on Weighted Terrain Surfaces. 107-118 - Hidetomo Machi, Kohji Tomita, Chiharu Hosono:
The Relative Completeness of a Version of CTL*. 81-85 - Chris Pollett, Norman Danner:
Circuit Principles and Weak Pigeonhole Variants. 31-40 - Elena Prieto:
The Method of Extremal Structure on the k-Maximum Cut Problem. 119-126 - Shane Saunders, Tadao Takaoka:
Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs. 127-131
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.