Journal: Theoretical Computer Science

Volume 282, Issue 2

221 -- 222Elena Lodi, Linda Pagli, Nicola Santoro. FUN with Algorithms - Foreword
223 -- 229Fabrizio Luccio. Algorithms, nymphs, and shepherds
231 -- 257David Peleg. Local majorities, coalitions and monopolies in graphs: a review
259 -- 270Paolo Boldi, Massimo Santini, Sebastiano Vigna. Measuring with jugs
271 -- 284Aviezri S. Fraenkel. Arrays, numeration systems and Frankenstein games
285 -- 302Alberto Pedrotti. Playing by searching: two strategies against a linearly bounded liar
303 -- 318Alon Itai, Michael Rodeh, Hadas Shachnai. The passport control problem or how to keep a dynamic service system load balanced?
319 -- 336Alain Daurat, Yan Gérard, Maurice Nivat. The chords problem
337 -- 352Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri. A strip-like tiling algorithm
353 -- 380Ronald I. Becker, Bruno Simeone, Yen-I Chiang. A shifting algorithm for continuous tree partitioning
381 -- 395Steven S. Seiden. A manifesto for the computational method

Volume 282, Issue 1

1 -- 3Joost-Pieter Katoen. Real-Time and Probabilistic Systems - Foreword
5 -- 32Mario Bravetti, Roberto Gorrieri. The theory of interactive generalized semi-Markov processes
33 -- 51Bengt Jonsson, Wang Yi. Testing preorders for probabilistic processes can be characterized by simulations
53 -- 99Paul Z. Kolano. Proof assistance for real-time systems using an interactive theorem prover
101 -- 150Marta Z. Kwiatkowska, Gethin J. Norman, Roberto Segala, Jeremy Sproston. Automatic verification of real-time systems with discrete probability distributions
151 -- 190Karl Lermer, Colin J. Fidge. A formal model of real-time program compilation
191 -- 219Annabelle McIver. Quantitative program logic and expected time bounds in probabilistic distributed algorithms