JCSS,
Volume 72
Volume 72,
Number 1,
February 2006
- Daniel R. Dooly, Sally A. Goldman, Stephen Kwek:
Real-valued multiple-instance learning with queries.
1-15
- Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan:
An improved approximation algorithm for vertex cover with hard capacities.
16-33
- Jörg Flum, Martin Grohe, Mark Weyer:
Bounded fixed-parameter tractability and log2n nondeterministic bits.
34-71
- Roni Khardon, Marta Arias:
The subsumption lattice and query learning.
72-94
- Marcus Hutter:
Sequential predictions based on algorithmic complexity.
95-117
- Matthew Andrews, Lisa Zhang:
Minimizing maximum fiber requirement in optical networks.
118-131
- Leah Epstein, Tamir Tassa:
Optimal preemptive scheduling for general target functions.
132-162
- Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
The many faces of a translation.
163-179
- Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS.
180-203
Volume 72,
Number 2,
March 2006
JCSS FOCS 2003 Special Issue
Volume 72,
Number 3,
May 2006
Network Algorithms 2005
Volume 72,
Number 4,
June 2006
- Lars Engebretsen, Marek Karpinski:
TSP with bounded metrics.
509-546
- Stéphane Demri, François Laroussinie, Ph. Schnoebelen:
A parametric analysis of the state-explosion problem in model checking.
547-575
- David Gross-Amblard, Michel de Rougemont:
Uniform generation in spatial constraint databases and applications.
576-591
- Yehuda Hassin, David Peleg:
Average probe complexity in quorum systems.
592-616
- Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun:
Infinite-state high-level MSCs: Model-checking and realizability.
617-647
- Michael Elkin, Guy Kortsarz:
Sublogarithmic approximation for telephone multicast.
648-659
- Holger Spakowski, Rahul Tripathi:
LWPP and WPP are not uniformly gap-definable.
660-689
- Zuhua Shao:
Security of the design of time-stamped signatures.
690-705
- Li Chunlin, Li Layuan:
A distributed multiple dimensional QoS constrained resource scheduling optimization policy in computational grid.
706-726
- I-En Liao, Cheng-Chi Lee, Min-Shiang Hwang:
A password authentication scheme over insecure networks.
727-740
- Hui-Cheng Xia, Deng-Feng Li, Ji-Yan Zhou, Jian-Ming Wang:
Fuzzy LINMAP method for multiattribute decision making under fuzzy environments.
741-759
- John M. Hitchcock, N. V. Vinodchandran:
Dimension, entropy rates, and compression.
760-782
Corrigendum
Volume 72,
Number 5,
August 2006
Special Issue on FOCS 2001
- Moses Charikar:
Guest editor's foreword.
785
- Amnon Ta-Shma, David Zuckerman, Shmuel Safra:
Extractors from Reed-Muller codes.
786-812
- Camil Demetrescu, Giuseppe F. Italiano:
Fully dynamic all pairs shortest paths with real edge weights.
813-837
- Lisa Fleischer, Kamal Jain, David P. Williamson:
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems.
838-867
- Jittat Fakcharoenphol, Satish Rao:
Planar graphs, negative weight edges, shortest paths, and near linear time.
868-889
- Yair Bartal, Béla Bollobás, Manor Mendel:
Ramsey-type theorems for metric spaces with applications to online problems.
890-921
- Tim Roughgarden:
On the severity of Braess's Paradox: Designing networks for selfish users is hard.
922-953
Volume 72,
Number 6,
September 2006
- Yogish Sabharwal, Nishant Sharma, Sandeep Sen:
Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions.
955-977
- Mario Di Raimondo, Rosario Gennaro:
Provably secure threshold password-authenticated key exchange.
978-1001
- Hung-Min Sun, Her-Tyan Yeh:
Password-based authentication and key distribution protocols with perfect forward secrecy.
1002-1011
- Michal Parnas, Dana Ron, Ronitt Rubinfeld:
Tolerant property testing and distance approximation.
1012-1042
- Elmar Böhler, Christian Glaßer, Daniel Meister:
Error-bounded probabilistic computations between MA and AM.
1043-1076
- James Aspnes, Kevin L. Chang, Aleksandr Yampolskiy:
Inoculation strategies for victims of viruses and the sum-of-squares partition problem.
1077-1093
- Anand Srinivasan, James H. Anderson:
Optimal rate-based scheduling on multiprocessors.
1094-1117
Volume 72,
Number 7,
November 2006
Special issue:
Performance modelling and evaluation of computer systems
- Irfan Awan:
Performance modelling and evaluation of computer systems.
1119-1120
- Armando Ferro, Igor Delgado, Alejandro Muñoz, Fidel Liberal:
An analytical model for loss estimation in network traffic analysis systems.
1121-1133
- Alessio Botta, Donato Emma, Antonio Pescapè, Giorgio Ventre:
Systematic performance modeling and characterization of heterogeneous IP networks.
1134-1143
- Inn 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.
1144-1155
- Almudena Konrad, Ben Y. Zhao, Anthony D. Joseph:
Determining model accuracy of network traces.
1156-1171
- Ella Grishikashvili Pereira, Rubem Pereira, A. Taleb-Bendiab:
Performance evaluation for self-healing distributed services and fault detection mechanisms.
1172-1182
- Makoto 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.
1183-1200
- Guang Tan, Stephen A. Jarvis:
Prediction of short-lived TCP transfer latency on bandwidth asymmetric links.
1201-1210
- Satoshi Itaya, Naohiro Hayashibara, Tomoya Enokido, Makoto Takizawa:
HAMS: Scalable peer-to-peer multimedia streaming model in heterogeneous networks.
1211-1225
- Muhammad Younas, Kuo-Ming Chao:
A tentative commit protocol for composite web services.
1226-1237
- Lin Guan, Michael E. Woodward, Irfan-Ullah Awan:
Control of queueing delay in a buffer with time-varying arrival rate.
1238-1248
Volume 72,
Number 8,
December 2006
Research Note
Regular Articles
- Bogdan S. Chlebus, Dariusz R. Kowalski:
Robust gossiping with an application to consensus.
1262-1281
- Michael Elkin:
A faster distributed protocol for constructing a minimum spanning tree.
1282-1308
- Fan R. K. Chung, Ronald L. Graham, Ranjita Bhagwan, Stefan Savage, Geoffrey M. Voelker:
Maximizing data locality in distributed systems.
1309-1316
- Christopher 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.
1317-1345
- Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
Strong computational lower bounds via parameterized complexity.
1346-1367
- Yousuke Takada, Teijiro Isokawa, Ferdinand Peper, Nobuyuki Matsui:
Construction universality in purely asynchronous cellular automata.
1368-1385
- Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke:
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization.
1386-1396
- Sara Gradara, Antonella Santone, Maria Luisa Villani:
DELFIN+: An efficient deadlock detection tool for CCS processes.
1397-1412
Copyright © Sat Nov 21 01:24:11 2009
by Michael Ley (ley@uni-trier.de)
