Volume 290,
Number 1,
January 2003
- Marios Mavronicolas, Nikos Papadakis:
Trade-off results for connection management.
1-57
- Frank A. Stomp:
Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm.
59-78
- Didier Caucal:
On infinite transition graphs having a decidable monadic theory.
79-115
- Marco Bernardo, Mario Bravetti:
Performance measure sensitive congruences for Markovian process algebras.
117-160
- Olivier Laurent:
Polarized proof-nets and lambda-µ-calculus.
161-188
- Silvio Valentini:
A cartesian closed category in Martin-Löf's intuitionistic type theory.
189-219
- Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni:
Bounded time-stamping in message-passing systems.
221-239
- Parosh Aziz Abdulla, Bengt Jonsson:
Model checking of systems with many identical timed processes.
241-264
- Dorel Lucanu:
Relaxed models for rewriting logic.
265-289
- Cesare Tinelli, Christophe Ringeissen:
Unions of non-disjoint theories and combinations of satisfiability procedures.
291-353
- Mario Bravetti, Alessandro Aldini:
Discrete time generative-reactive probabilistic processes with different advancing speeds.
355-406
- Franco Barbanera, Stefano Berardi:
A full continuous model of polymorphism.
407-428
- Koji Nakazawa:
Confluency and strong normalizability of call-by-value lambda-µ-calculus.
429-463
- Andrea Maggiolo-Schettini, Adriano Peron, Simone Tini:
A comparison of Statecharts step semantics.
465-498
- Carlos Iván Chesñevar, Jürgen Dix, Frieder Stolzenburg, Guillermo Ricardo Simari:
Relating defeasible and normal logic programming through transformation properties.
499-529
- Patrick Cousot, Radhia Cousot:
Parsing as abstract interpretation of grammar semantics.
531-544
- Zhaohui Zhu, Bin Li, Xian Xiao, Shifu Chen, Wujia Zhu:
A representation theorem for recovering contraction relations satisfying wci.
545-564
- Luca de Alfaro, Arjun Kapur:
Hybrid diagrams.
565-597
- Fabio Alessi, Paolo Baldan, Furio Honsell:
A category of compositional domain-models for separable Stone spaces.
599-635
- Luca Bernardinello, Carlo Ferigato, Lucia Pomello:
An algebraic model of observable properties in distributed systems.
637-668
- Toon Calders, Jan Paredaens:
Axiomatization of frequent itemsets.
669-693
- Roberto M. Amadio, Denis Lugiez, Vincent Vanackère:
On the symbolic reduction of processes with cryptographic functions.
695-740
- Cosimo Laneve:
A type system for JVM threads.
741-778
- Yuxi Fu, Zhenrong Yang:
Understanding the mismatch combinator in chi calculus.
779-830
- Michael R. Laurence, Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd:
Equivalence of conservative, free, linear program schemas is decidable.
831-862
- Roberta Gori:
An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
863-936
- Mauno Rönkkö, Anders P. Ravn, Kaisa Sere:
Hybrid action systems.
937-973
- Steffen van Bakel, Maribel Fernández:
Normalization, approximation, and semantics for combinator systems.
975-1019
- Reinhard Pichler:
Explicit versus implicit representations of subsets of the Herbrand universe.
1021-1056
- Fabio Martinelli:
Analysis of security protocols as open systems.
1057-1106
- Thierry Coquand:
A syntactical proof of the Marriage Lemma.
1107-1113
Volume 290,
Number 2,
January 2003
Dependable Computing
- Gilles Motet, Jean Claude Geffroy:
Dependable computing: an overview.
1115-1126
- Guohong Cao, Mukesh Singhal:
Checkpointing with mutable checkpoints.
1127-1148
- Antonio Caruso, Stefano Chessa, Piero Maestrini, Paolo Santi:
Fault-diagnosis of grid structures.
1149-1174
- Christopher Colby, Karl Crary, Robert Harper, Peter Lee, Frank Pfenning:
Automated techniques for provably safe mobile code.
1175-1199
- I. S. W. B. Prasetya, S. Doaitse Swierstra:
Factorizing fault tolerance.
1201-1222
- Chris J. Walter, Neeraj Suri:
The customizable fault/error model for dependable distributed systems.
1223-1251
Volume 290,
Number 3,
January 2003
- Jacques Duparc:
A hierarchy of deterministic context-free omega-languages.
1253-1300
- Masashi Katsura, Yuji Kobayashi:
Undecidable properties of monoids with word problem solvable in linear time.
1301-1316
- Christoph Dürr, Eric Goles Ch., Ivan Rapaport, Eric Rémila:
Tiling with bars under tomographic constraints.
1317-1329
- Alfredo Goldman, Grégory Mounié, Denis Trystram:
1-optimality of static BSP computations: scheduling independent chains as a case study.
1331-1359
- Amihood Amir, Gad M. Landau, Dina Sokol:
Inplace run-length 2d compressed search.
1361-1383
- Olivier Finkel:
Borel hierarchy and omega context free languages.
1385-1405
- Philippe Blayo, Pierre Rouzé, Marie-France Sagot:
Orphan gene finding - an exon assembly approach.
1407-1431
- Andrei A. Muchnik:
The definable criterion for definability in Presburger arithmetic and its applications.
1433-1444
- Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire:
Criteria to disprove context freeness of collage languages.
1445-1458
- Jacek Blazewicz, Marta Kasprzak:
Complexity of DNA sequencing by hybridization.
1459-1473
- Hsien-Kuei Hwang, Tsung-Hsi Tsai:
An asymptotic theory for recurrence relations based on minimization and maximization.
1475-1501
- Victor Chepoi, Alexis Rollin:
Interval routing in some planar networks.
1503-1540
- Koji Nakano, Stephan Olariu, Albert Y. Zomaya:
A time-optimal solution for the path cover problem on cographs.
1541-1556
- Salah Hussini, Lila Kari, Stavros Konstantinidis:
Coding properties of DNA languages.
1557-1579
- Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto:
McNaughton families of languages.
1581-1628
- Michele D'amico, Giovanni Manzini, Luciano Margara:
On computing the entropy of cellular automata.
1629-1646
- Yacine Boufkhad, Olivier Dubois, Maurice Nivat:
Reconstructing (h, v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections.
1647-1664
- Judit Csima, Erzsébet Csuhaj-Varjú, Arto Salomaa:
Power and size of extended Watson-Crick L systems.
1665-1678
- Henning Fernau:
Identification of function distinguishable languages.
1679-1711
- Oscar H. Ibarra, Zhe Dang, Pierluigi San Pietro:
Verification in loosely synchronous queue-connected discrete timed automata.
1713-1735
- Samuel T. Chanson, Cunsheng Ding, Arto Salomaa:
Cartesian authentication codes from functions with optimal nonlinearity.
1737-1752
- Frank S. de Boer, Rogier M. van Eijk, Wiebe van der Hoek, John-Jules Ch. Meyer:
A fully abstract model for the exchange of information in multi-agent systems.
1753-1773
- Priti Shankar, Amitava Dasgupta, Kaustubh Deshmukh, B. Sundar Rajan:
On viewing block codes as finite automata.
1775-1797
- Jayme Luiz Szwarcfiter, Gonzalo Navarro, Ricardo A. Baeza-Yates, Joísa de S. Oliveira, Walter Cunto, Nivio Ziviani:
Optimal binary search trees with costs depending on the access paths.
1799-1814
- Martin E. Dyer, Alan M. Frieze, Michael Molloy:
A probabilistic analysis of randomly generated binary constraint satisfaction problems.
1815-1828
- Stasys Jukna, Stanislav Zák:
On uncertainty versus size in branching programs.
1851-1867
- Juha Honkala:
On images of D0L and DT0L power series.
1869-1882
- Jop F. Sibeyn:
Faster deterministic sorting through better sampling.
1829-1850
- Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König:
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
1883-1895
- Antonio Puricella, Iain A. Stewart:
Greedy algorithms, H-colourings and a complexity-theoretic dichotomy.
1897-1913
- I. Dutour, Jean-Marc Fedou:
Object grammars and bijections.
1915-1929
- Andrei A. Muchnik:
One application of real-valued interpretation of formal power series.
1931-1946
- Peter G. Harrison:
Turning back time in Markovian process algebra.
1947-1986
- Bruno Durand, Vladimir Kanovei, Vladimir A. Uspensky, Nikolai K. Vereshchagin:
Do stronger definitions of randomness exist?
1987-1996
- Marek Chrobak, Elias Koutsoupias, John Noga:
More on randomized on-line algorithms for caching.
1997-2008
- Gianluca De Marco, Andrzej Pelc:
Deterministic broadcasting time with partial knowledge of the network.
2009-2020
- Gaia Nicosia, Gianpaolo Oriolo:
An approximate A* algorithm and its application to the SCS problem.
2021-2029
- Ioan Tomescu:
On the number of occurrences of all short factors in almost all words.
2031-2035
- Mao-cheng Cai, Xiaotie Deng, Lusheng Wang:
Approximate sequencing for variable length tasks.
2037-2044
- Wilfried Meidl:
Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences.
2045-2051
- José Carlos Costa:
Biinfinite words with maximal recurrent unbordered factors.
2053-2061
- Armando B. Matos:
Linear programs in a simple reversible language.
2063-2074
- Véronique Terrier:
Characterization of real time iterative array by alternating device.
2075-2084
- A. A. Arratia-Quesada, Iain A. Stewart:
A note on first-order projections and games.
2085-2093
- Dafa Li:
Is DNA computing viable for 3-SAT problems?
2095-2107
- Irène Charon, Olivier Hudry, Antoine Lobstein:
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
2109-2120
- Henning Fernau, Alexander Meduna:
On the degree of scattered context-sensitivity.
2121-2124
- Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger:
On tiling under tomographic constraints.
2125-2136
- Ayse Karaman:
Weak repetitions in Sturmian strings.
2137-2146
- George Steiner:
On the k-path partition of graphs.
2147-2155
- Hung Q. Ngo:
A new routing algorithm for multirate rearrangeable Clos networks.
2157-2167
- Lajos Hajdu, Robert Tijdeman:
Algebraic aspects of emission tomography with absorption.
2169-2181
- Kosaburo Hashiguchi:
Erratum to "New upper bounds to the limitedness of distance automata".
2183
Copyright © Mon Nov 2 21:56:15 2009
by Michael Ley (ley@uni-trier.de)
