![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Information and Computation, Volume 150
Volume 150, Number 1, April 1999
- A. J. Kfoury, Simona Ronchi Della Rocca, Jerzy Tiuryn, Pawel Urzyczyn:
Alpha-Conversion and Typability. 1-21 - Kenji Yamanishi:
Distributed Cooperative Bayesian Learning Strategies. 22-56 - Sudipto Guha, Samir Khuller:
Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. 57-74 - Louise E. Moser, P. M. Melliar-Smith:
Byzantine-Resistant Total Ordering Algorithms. 75-111 - Norbert Blum, Robert Koch:
Greibach Normal Form Transformation Revisited. 112-118
Volume 150, Number 2, May 1999
- Angelo Gargantini
, Dino Mandrioli, Angelo Morzenti:
Dealing with Zero-Time Transitions in Axiom Systems. 119-131 - Rob Gerth, Ruurd Kuiper, Doron A. Peled, Wojciech Penczek
:
A Partial Order Approach to Branching Time Logic Model Checking. 132-152 - Mariangiola Dezani-Ciancaglini
, Jerzy Tiuryn, Pawel Urzyczyn:
Discrimination by Parallel Observers: The Algorithm. 153-186 - Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
:
Malign Distributions for Average Case Circuit Complexity. 187-208 - Yonit Kesten, Amir Pnueli, Joseph Sifakis, Sergio Yovine
:
Decidable Integration Graphs. 209-243 - Allan Borodin, Ran El-Yaniv:
On Randomization in On-Line Computation. 244-267 - Stéphane Grumbach, Tova Milo:
An Algebra for Pomsets. 268-306
![](https://dblp.uni-trier.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.