Journal: J. Comput. Syst. Sci.

Volume 72, Issue 8

1251 -- 1261Jon Grov, Ragnar Normann. Technical note: Replication graphs revisited
1262 -- 1281Bogdan S. Chlebus, Dariusz R. Kowalski. Robust gossiping with an application to consensus
1282 -- 1308Michael Elkin. A faster distributed protocol for constructing a minimum spanning tree
1309 -- 1316Fan R. K. Chung, Ronald L. Graham, Ranjita Bhagwan, Stefan Savage, Geoffrey M. Voelker. Maximizing data locality in distributed systems
1317 -- 1345Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. Complexity of reachability problems for finite discrete dynamical systems
1346 -- 1367Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia. Strong computational lower bounds via parameterized complexity
1368 -- 1385Yousuke Takada, Teijiro Isokawa, Ferdinand Peper, Nobuyuki Matsui. Construction universality in purely asynchronous cellular automata
1386 -- 1396Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke. Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
1397 -- 1412Sara Gradara, Antonella Santone, Maria Luisa Villani. DELFIN:::+:::: An efficient deadlock detection tool for CCS processes

Volume 72, Issue 7

1119 -- 1120Irfan Awan. Performance modelling and evaluation of computer systems
1121 -- 1133Armando Ferro, Igor Delgado, Alejandro Muñoz, Fidel Liberal. An analytical model for loss estimation in network traffic analysis systems
1134 -- 1143Alessio Botta, Donato Emma, Antonio Pescapè, Giorgio Ventre. Systematic performance modeling and characterization of heterogeneous IP networks
1144 -- 1155Inn Inn Er, Winston Khoon Guan Seah. Clustering overhead and convergence time analysis of the mobility-based multi-hop clustering algorithm for mobile ad hoc networks
1156 -- 1171Almudena Konrad, Ben Y. Zhao, Anthony D. Joseph. Determining model accuracy of network traces
1172 -- 1182Ella Grishikashvili Pereira, Rubem Pereira, A. Taleb-Bendiab. Performance evaluation for self-healing distributed services and fault detection mechanisms
1183 -- 1200Makoto Ikeda, Leonard Barolli, Akio Koyama, Arjan Durresi, Giuseppe De Marco, Jiro Iwashige. Performance evaluation of an intelligent CAC and routing framework for multimedia applications in broadband networks
1201 -- 1210Guang Tan, Stephen A. Jarvis. Prediction of short-lived TCP transfer latency on bandwidth asymmetric links
1211 -- 1225Satoshi Itaya, Naohiro Hayashibara, Tomoya Enokido, Makoto Takizawa. HAMS: Scalable peer-to-peer multimedia streaming model in heterogeneous networks
1226 -- 1237Muhammad Younas, Kuo-Ming Chao. A tentative commit protocol for composite web services
1238 -- 1248Lin Guan, Michael E. Woodward, Irfan-Ullah Awan. Control of queueing delay in a buffer with time-varying arrival rate

Volume 72, Issue 6

955 -- 977Yogish Sabharwal, Nishant Sharma, Sandeep Sen. Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions
978 -- 1001Mario Di Raimondo, Rosario Gennaro. Provably secure threshold password-authenticated key exchange
1002 -- 1011Hung-Min Sun, Her-Tyan Yeh. Password-based authentication and key distribution protocols with perfect forward secrecy
1012 -- 1042Michal Parnas, Dana Ron, Ronitt Rubinfeld. Tolerant property testing and distance approximation
1043 -- 1076Elmar Böhler, Christian Glaßer, Daniel Meister. Error-bounded probabilistic computations between MA and AM
1077 -- 1093James Aspnes, Kevin L. Chang, Aleksandr Yampolskiy. Inoculation strategies for victims of viruses and the sum-of-squares partition problem
1094 -- 1117Anand Srinivasan, James H. Anderson. Optimal rate-based scheduling on multiprocessors

Volume 72, Issue 5

785 -- 0Moses Charikar. Guest editor s foreword
786 -- 812Amnon Ta-Shma, David Zuckerman, Shmuel Safra. Extractors from Reed-Muller codes
813 -- 837Camil Demetrescu, Giuseppe F. Italiano. Fully dynamic all pairs shortest paths with real edge weights
838 -- 867Lisa Fleischer, Kamal Jain, David P. Williamson. Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
868 -- 889Jittat Fakcharoenphol, Satish Rao. Planar graphs, negative weight edges, shortest paths, and near linear time
890 -- 921Yair Bartal, Béla Bollobás, Manor Mendel. Ramsey-type theorems for metric spaces with applications to online problems
922 -- 953Tim Roughgarden. On the severity of Braess s Paradox: Designing networks for selfish users is hard

Volume 72, Issue 4

509 -- 546Lars Engebretsen, Marek Karpinski. TSP with bounded metrics
547 -- 575Stéphane Demri, François Laroussinie, Ph. Schnoebelen. A parametric analysis of the state-explosion problem in model checking
576 -- 591David Gross-Amblard, Michel de Rougemont. Uniform generation in spatial constraint databases and applications
592 -- 616Yehuda Hassin, David Peleg. Average probe complexity in quorum systems
617 -- 647Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun. Infinite-state high-level MSCs: Model-checking and realizability
648 -- 659Michael Elkin, Guy Kortsarz. Sublogarithmic approximation for telephone multicast
660 -- 689Holger Spakowski, Rahul Tripathi. LWPP and WPP are not uniformly gap-definable
690 -- 705Zuhua Shao. Security of the design of time-stamped signatures
706 -- 726Li Chunlin, Li Layuan. A distributed multiple dimensional QoS constrained resource scheduling optimization policy in computational grid
727 -- 740I-En Liao, Cheng-Chi Lee, Min-Shiang Hwang. A password authentication scheme over insecure networks
741 -- 759Hui-Cheng Xia, Deng-Feng Li, Ji-Yan Zhou, Jian-Ming Wang. Fuzzy LINMAP method for multiattribute decision making under fuzzy environments
760 -- 782John M. Hitchcock, N. V. Vinodchandran. Dimension, entropy rates, and compression
783 -- 0Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán. Corrigendum to Completeness results for graph isomorphism [J. Comput. System Sci. 66(2003) 549-566]

Volume 72, Issue 3

419 -- 0Fan Chung Graham. Foreword
420 -- 424Fan Chung Graham. A brief overview of network algorithms
425 -- 443C. Greg Plaxton. Approximation algorithms for hierarchical location problems
444 -- 467Richard Cole, Yevgeniy Dodis, Tim Roughgarden. How much can taxes help selfish routing?
468 -- 489Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram. Meet and merge: Approximation algorithms for confluent flows
490 -- 506Robert Elsässer, Leszek Gasieniec. Radio communication in random graphs

Volume 72, Issue 2

205 -- 0Chandra Chekuri, Daniele Micciancio. Special Issue: FOCS 2003
206 -- 219Subhash Khot. Hardness of approximating the Shortest Vector Problem in high ::::l::p:::::: norms
220 -- 238Andris Ambainis. Polynomial degree vs. quantum query complexity
239 -- 251Milena Mihail, Christos H. Papadimitriou, Amin Saberi. On certain connectivity properties of the internet topology
252 -- 285Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton. Symmetric polynomials over Z::::::m:::::: and simultaneous communication protocols
286 -- 320Russell Impagliazzo, Bruce M. Kapron. Logics for reasoning about cryptographic constructions
321 -- 391Boaz Barak, Yehuda Lindell, Salil P. Vadhan. Lower bounds for non-black-box zero knowledge
392 -- 417László Lovász, Santosh Vempala. Simulated annealing in convex bodies and an ::::O:::::::*:::(::::n:::::::4:::) volume algorithm

Volume 72, Issue 1

1 -- 15Daniel R. Dooly, Sally A. Goldman, Stephen Kwek. Real-valued multiple-instance learning with queries
16 -- 33Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan. An improved approximation algorithm for vertex cover with hard capacities
34 -- 71Jörg Flum, Martin Grohe, Mark Weyer. Bounded fixed-parameter tractability and log:::2:::::::n:::: nondeterministic bits
72 -- 94Roni Khardon, Marta Arias. The subsumption lattice and query learning
95 -- 117Marcus Hutter. Sequential predictions based on algorithmic complexity
118 -- 131Matthew Andrews, Lisa Zhang. Minimizing maximum fiber requirement in optical networks
132 -- 162Leah Epstein, Tamir Tassa. Optimal preemptive scheduling for general target functions
163 -- 179Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer. The many faces of a translation
180 -- 203Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin. Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS