Volume 80,
Number 1,
15 October 2001
Process Algebra
- Luca Aceto, Wan Fokkink:
Preface: Process Algebra.
1
- Anna Philippou, Oleg Sokolsky, Insup Lee, Rance Cleaveland, Scott A. Smolka:
Hiding resources that can fail: An axiomatic perspective.
3-13
- Diego Cazorla, Fernando Cuartero, Valentín Valero Ruiz, Fernando L. Pelayo:
A process algebra for probabilistic and nondeterministic processes.
15-23
- Corrado Priami, Aviv Regev, Ehud Y. Shapiro, William Silverman:
Application of a stochastic name-passing calculus to representation and simulation of molecular processes.
25-31
- Mark van der Zwaag:
The cones and foci proof technique for timed transition systems.
33-40
- Jan A. Bergstra, Alban Ponse:
Process algebra and conditional composition.
41-49
- Marc Voorhoeve, Sjouke Mauw:
Impossible futures and determinism.
51-58
- Alban Ponse, Yaroslav S. Usenko:
Equivalence of recursive specifications in process algebra.
59-65
Volume 80,
Number 2,
31 October 2001
- Jovan Dj. Golic:
A probabilistic cryptanalytic method for a time-variant permutation generator.
67-73
- Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie:
Algorithmic construction of Hamiltonians in pyramids.
75-79
- Jorge Alberto Calvo, Danny Krizanc, Pat Morin, Michael A. Soss, Godfried T. Toussaint:
Convexifying polygons with simple projections.
81-86
- Seok-Lyong Lee, Chin-Wan Chung:
On the effective clustering of multidimensional data sequences.
87-95
- Sanjoy K. Baruah:
Scheduling periodic tasks on uniform multiprocessors.
97-104
- Roberto Baldoni, Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal:
Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property.
105-111
- Hung-Yu Chien, Tzong-Chen Wu, Jinn-ke Jan, Yuh-Min Tseng:
Cryptanalysis of Chang-Wu's group-oriented authentication and key exchange protocols.
113-117
Volume 80,
Number 3,
15 November 2001
- Gennaro Costagliola, Vincenzo Deufemia, Filomena Ferrucci, Carmine Gravino:
Decidability of the consistency problem for regular symbolic picture description languages.
119-124
- Eberhard Bertsch, Mark-Jan Nederhof:
Size/lookahead tradeoff for LL(k)-grammars.
125-129
- Flemming Nielson, Hanne Riis Nielson, Shmuel Sagiv:
Kleene's Logic with Equality.
131-137
- Ahmad Kadrie, V. Rajkumar Dare, D. G. Thomas, K. G. Subramanian:
Algebraic properties of the shuffle over omega-trajectories.
139-144
- Franck Seynhaeve:
Set constraints and topology.
145-150
- Saad Biaz, Jennifer L. Welch:
Closed form bounds for clock synchronization under simple uncertainty assumptions.
151-157
- Shing-Tsaan Huang, Bau-Wen Chen:
Optimal 1-fair alternators.
159-163
- Mathieu Raffinot:
On maximal repeats in strings.
165-169
Volume 80,
Number 4,
30 November 2001
Volume 80,
Number 5,
15 December 2001
- Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Maximal matching stabilizes in time O(m).
221-223
- Han Wook Lee, Dae Woong Kim, Chan-Ik Park:
Phased RGSS: An improved disk array scheduling for continuous media retrieval.
225-231
- Clare E. Martin, Jeremy Gibbons:
On the semantics of nested datatypes.
233-238
- Maria Isabel Gonzalez Vasco, Rainer Steinwandt:
Clouds over a public key cryptosystem based on Lyndon words.
239-242
- Jaikumar Radhakrishnan, Venkatesh Raman:
A tradeoff between search and update in dictionaries.
243-247
- Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
Routing and path multicoloring.
249-256
- Frederic Green, Randall Pruim:
Relativized separation of EQP from PNP.
257-260
- Nigel P. Smart:
A note on the x-coordinate of points on an elliptic curve in characteristic two.
261-263
- Xudong Guan, Yiling Yang, Jinyuan You:
Typing evolving ambients.
265-270
Copyright © Mon Nov 2 21:41:13 2009
by Michael Ley (ley@uni-trier.de)
