Information Processing Letters, Volume 80

Volume 80, Number 1, 15 October 2001

• Luca Aceto, Wan Fokkink:
  Preface: Process Algebra. 1
  Electronic Edition (link) BibTeX
• Anna Philippou, Oleg Sokolsky, Insup Lee, Rance Cleaveland, Scott A. Smolka:
  Hiding resources that can fail: An axiomatic perspective. 3-13
  Electronic Edition (link) BibTeX
• Diego Cazorla, Fernando Cuartero, Valentín Valero Ruiz, Fernando L. Pelayo:
  A process algebra for probabilistic and nondeterministic processes. 15-23
  Electronic Edition (link) BibTeX
• 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
  Electronic Edition (link) BibTeX
• Mark van der Zwaag:
  The cones and foci proof technique for timed transition systems. 33-40
  Electronic Edition (link) BibTeX
• Jan A. Bergstra, Alban Ponse:
  Process algebra and conditional composition. 41-49
  Electronic Edition (link) BibTeX
• Marc Voorhoeve, Sjouke Mauw:
  Impossible futures and determinism. 51-58
  Electronic Edition (link) BibTeX
• Alban Ponse, Yaroslav S. Usenko:
  Equivalence of recursive specifications in process algebra. 59-65
  Electronic Edition (link) BibTeX

Volume 80, Number 2, 31 October 2001

• Jovan Dj. Golic:
  A probabilistic cryptanalytic method for a time-variant permutation generator. 67-73
  Electronic Edition (link) BibTeX
• Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie:
  Algorithmic construction of Hamiltonians in pyramids. 75-79
  Electronic Edition (link) BibTeX
• Jorge Alberto Calvo, Danny Krizanc, Pat Morin, Michael A. Soss, Godfried T. Toussaint:
  Convexifying polygons with simple projections. 81-86
  Electronic Edition (link) BibTeX
• Seok-Lyong Lee, Chin-Wan Chung:
  On the effective clustering of multidimensional data sequences. 87-95
  Electronic Edition (link) BibTeX
• Sanjoy K. Baruah:
  Scheduling periodic tasks on uniform multiprocessors. 97-104
  Electronic Edition (link) BibTeX
• 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
  Electronic Edition (link) BibTeX
• 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
  Electronic Edition (link) BibTeX

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
  Electronic Edition (link) BibTeX
• Eberhard Bertsch, Mark-Jan Nederhof:
  Size/lookahead tradeoff for LL(k)-grammars. 125-129
  Electronic Edition (link) BibTeX
• Flemming Nielson, Hanne Riis Nielson, Shmuel Sagiv:
  Kleene's Logic with Equality. 131-137
  Electronic Edition (link) BibTeX
• Ahmad Kadrie, V. Rajkumar Dare, D. G. Thomas, K. G. Subramanian:
  Algebraic properties of the shuffle over omega-trajectories. 139-144
  Electronic Edition (link) BibTeX
• Franck Seynhaeve:
  Set constraints and topology. 145-150
  Electronic Edition (link) BibTeX
• Saad Biaz, Jennifer L. Welch:
  Closed form bounds for clock synchronization under simple uncertainty assumptions. 151-157
  Electronic Edition (link) BibTeX
• Shing-Tsaan Huang, Bau-Wen Chen:
  Optimal 1-fair alternators. 159-163
  Electronic Edition (link) BibTeX
• Mathieu Raffinot:
  On maximal repeats in strings. 165-169
  Electronic Edition (link) BibTeX

Volume 80, Number 4, 30 November 2001

• Refael Hassin, Shlomi Rubinstein:
  Approximation algorithms for maximum linear arrangement. 171-177
  Electronic Edition (link) BibTeX
• Jérôme Monnot:
  The maximum f-depth spanning tree problem. 179-187
  Electronic Edition (link) BibTeX
• Minkyu Lee, Dongsoo Han, Jaeyong Shim:
  Set-based access conflict analysis of concurrent workflow definition. 189-194
  Electronic Edition (link) BibTeX
• Dong-Joo Park, Shin Heu, Hyoung-Joo Kim:
  The RS-tree: An efficient data structure for distance browsing queries. 195-203
  Electronic Edition (link) BibTeX
• Ye-In Chang, Bor-Hsu Chen:
  A generalized grid quorum strategy for k-mutual exclusion in distributed systems. 205-212
  Electronic Edition (link) BibTeX
• Goran Konjevod, R. Ravi, F. Sibel Salman:
  On approximating planar metrics by tree metrics. 213-219
  Electronic Edition (link) BibTeX

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
  Electronic Edition (link) BibTeX
• Han Wook Lee, Dae Woong Kim, Chan-Ik Park:
  Phased RGSS: An improved disk array scheduling for continuous media retrieval. 225-231
  Electronic Edition (link) BibTeX
• Clare E. Martin, Jeremy Gibbons:
  On the semantics of nested datatypes. 233-238
  Electronic Edition (link) BibTeX
• Maria Isabel Gonzalez Vasco, Rainer Steinwandt:
  Clouds over a public key cryptosystem based on Lyndon words. 239-242
  Electronic Edition (link) BibTeX
• Jaikumar Radhakrishnan, Venkatesh Raman:
  A tradeoff between search and update in dictionaries. 243-247
  Electronic Edition (link) BibTeX
• Christos Nomikos, Aris Pagourtzis, Stathis Zachos:
  Routing and path multicoloring. 249-256
  Electronic Edition (link) BibTeX
• Frederic Green, Randall Pruim:
  Relativized separation of EQP from P^NP. 257-260
  Electronic Edition (link) BibTeX
• Nigel P. Smart:
  A note on the x-coordinate of points on an elliptic curve in characteristic two. 261-263
  Electronic Edition (link) BibTeX
• Xudong Guan, Yiling Yang, Jinyuan You:
  Typing evolving ambients. 265-270
  Electronic Edition (link) BibTeX