Information Processing Letters, Volume 80
Volume 80, Number 1, 15 October 2001
- 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
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
- 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
- Mathieu Raffinot: On maximal repeats in strings. 165-169
Volume 80, Number 4, 30 November 2001
- Jérôme Monnot: The maximum f-depth spanning tree problem. 179-187
- Minkyu Lee, Dongsoo Han, Jaeyong Shim: Set-based access conflict analysis of concurrent workflow definition. 189-194
- Dong-Joo Park, Shin Heu, Hyoung-Joo Kim: The RS-tree: An efficient data structure for distance browsing queries. 195-203
- Ye-In Chang, Bor-Hsu Chen: A generalized grid quorum strategy for k-mutual exclusion in distributed systems. 205-212
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
- 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
- Nigel P. Smart: A note on the x-coordinate of points on an elliptic curve in characteristic two. 261-263
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team