- Email: [email protected]
Contents of Volume 72
Contents of Volume 72 Number 1, February 2006 1
Real-valued multiple-instance learning with queries Daniel R. Dooly, Sally A. Goldman, Stephen S. Kwek
16
An improved approximation algorithm for vertex cover with hard capacities Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan
34
Bounded fixed-parameter tractability and log2 n nondeterministic bits Jörg Flum, Martin Grohe, Mark Weyer
72
The subsumption lattice and query learning Roni Khardon, Marta Arias
95
Sequential predictions based on algorithmic complexity Marcus Hutter
118
Minimizing maximum fiber requirement in optical networks Matthew Andrews, Lisa Zhang
132
Optimal preemptive scheduling for general target functions Leah Epstein, Tamir Tassa
163
The many faces of a translation Pierre McKenzie, Thomas Schwentick, Denis Therien, Heribert Vollmer
180
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS G. Geeraerts, J.-F. Raskin, L. Van Begin
204
Papers to appear in forthcoming issues
Number 2, March 2006 Special Issue on FOCS 2003 Guest Editors: Chandra Chekuri and Daniele Micciancio 205
Foreword Chandra Chekuri, Daniele Micciancio
206
Hardness of approximating the Shortest Vector Problem in high p norms Subhash Khot
220
Polynomial degree vs. quantum query complexity Andris Ambainis
239
On certain connectivity properties of the internet topology Milena Mihail, Christos Papadimitriou, Amin Saberi
252
Symmetric polynomials over Z m and simultaneous communication protocols Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
286
Logics for reasoning about cryptographic constructions Russell Impagliazzo, Bruce M. Kapron
321
Lower bounds for non-black-box zero knowledge Boaz Barak, Yehuda Lindell, Salil Vadhan
392
Simulated annealing in convex bodies and an O ∗ (n4 ) volume algorithm László Lovász, Santosh Vempala
418
Papers to appear in forthcoming issues
Number 3, May 2006 Special Issue on Network Algorithms 2005 Guest Editor: Fan Chung Graham 419
Foreword Fan Chung Graham
420
A brief overview of network algorithms Fan Chung Graham
425
Approximation algorithms for hierarchical location problems C. Greg Plaxton
444
How much can taxes help selfish routing? Richard Cole, Yevgeniy Dodis, Tim Roughgarden
468
Meet and merge: Approximation algorithms for confluent flows Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram
490
Radio communication in random graphs R. Elsässer, L. Gasieniec ˛
507
Papers to appear in forthcoming issues
Number 4, June 2006 509
TSP with bounded metrics Lars Engebretsen, Marek Karpinski
547
A parametric analysis of the state-explosion problem in model checking S. Demri, F. Laroussinie, Ph. Schnoebelen
576
Uniform generation in spatial constraint databases and applications David Gross-Amblard, Michel de Rougemont
592
Average probe complexity in quorum systems Yehuda Hassin, David Peleg
617
Infinite-state high-level MSCs: Model-checking and realizability Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun
648
Sublogarithmic approximation for telephone multicast Michael Elkin, Guy Kortsarz
660
LWPP and WPP are not uniformly gap-definable Holger Spakowski, Rahul Tripathi
690
Security of the design of time-stamped signatures Zuhua Shao
706
A distributed multiple dimensional QoS constrained resource scheduling optimization policy in computational grid Li Chunlin, Li Layuan
727
A password authentication scheme over insecure networks I-En Liao, Cheng-Chi Lee, Min-Shiang Hwang
741
Fuzzy LINMAP method for multiattribute decision making under fuzzy environments Hui-Cheng Xia, Deng-Feng Li, Ji-Yan Zhou, Jian-Ming Wang
760
Dimension, entropy rates, and compression John M. Hitchcock, N.V. Vinodchandran Corrigendum
783
Corrigendum to “Completeness results for graph isomorphism” [J. Comput. System Sci. 66 (2003) 549–566] Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán
784
Papers to appear in forthcoming issues
Number 5, August 2006 Special Issue on FOCS 2001 Guest Editor: Moses Charikar 785
Guest editor’s foreword Moses Charikar
786
Extractors from Reed–Muller codes Amnon Ta-Shma, David Zuckerman, Shmuel Safra
813
Fully dynamic all pairs shortest paths with real edge weights Camil Demetrescu, Giuseppe F. Italiano
838
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems Lisa Fleischer, Kamal Jain, David P. Williamson
868
Planar graphs, negative weight edges, shortest paths, and near linear time Jittat Fakcharoenphol, Satish Rao
890
Ramsey-type theorems for metric spaces with applications to online problems Yair Bartal, Béla Bollobás, Manor Mendel
922
On the severity of Braess’s Paradox: Designing networks for selfish users is hard Tim Roughgarden
954
Papers to appear in forthcoming issues
Number 6, September 2006 955
Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions Yogish Sabharwal, Nishant Sharma, Sandeep Sen
978
Provably secure threshold password-authenticated key exchange Mario Di Raimondo, Rosario Gennaro
1002
Password-based authentication and key distribution protocols with perfect forward secrecy Hung-Min Sun, Her-Tyan Yeh
1012
Tolerant property testing and distance approximation Michal Parnas, Dana Ron, Ronitt Rubinfeld
1043
Error-bounded probabilistic computations between MA and AM Elmar Böhler, Christian Glaßer, Daniel Meister
1077
Inoculation strategies for victims of viruses and the sum-of-squares partition problem James Aspnes, Kevin Chang, Aleksandr Yampolskiy
1094
Optimal rate-based scheduling on multiprocessors Anand Srinivasan, James H. Anderson
Number 7, November 2006 Special Issue: Performance modelling and evaluation of computer systems Guest Editor: Irfan Awan 1119
Performance modelling and evaluation of computer systems Irfan Awan
1121
An analytical model for loss estimation in network traffic analysis systems Armando Ferro, Igor Delgado, Alex Muñoz, Fidel Liberal
1134
Systematic performance modeling and characterization of heterogeneous IP networks Alessio Botta, Donato Emma, Antonio Pescapé, Giorgio Ventre
1144
Clustering overhead and convergence time analysis of the mobility-based multi-hop clustering algorithm for mobile ad hoc networks Inn Inn Er, Winston K.G. Seah
1156
Determining model accuracy of network traces Almudena Konrad, Ben Y. Zhao, Anthony D. Joseph
1172
Performance evaluation for self-healing distributed services and fault detection mechanisms E. Grishikashvili Pereira, R. Pereira, A. Taleb-Bendiab
1183
Performance evaluation of an intelligent CAC and routing framework for multimedia applications in broadband networks Makoto Ikeda, Leonard Barolli, Akio Koyama, Arjan Durresi, Giuseppe De Marco, Jiro Iwashige
1201
Prediction of short-lived TCP transfer latency on bandwidth asymmetric links Guang Tan, Stephen A. Jarvis
1211
HAMS: Scalable peer-to-peer multimedia streaming model in heterogeneous networks Satoshi Itaya, Naohiro Hayashibara, Tomoya Enokido, Makoto Takizawa
1226
A tentative commit protocol for composite web services Muhammad Younas, Kuo-Ming Chao
1238
Control of queueing delay in a buffer with time-varying arrival rate L. Guan, M.E. Woodward, I.U. Awan
1249
Papers to appear in forthcoming issues
Number 8, December 2006 Research Note 1251
Technical note: Replication graphs revisited Jon Grov, Ragnar Normann Regular Articles
1262
Robust gossiping with an application to consensus Bogdan S. Chlebus, Dariusz R. Kowalski
1282
A faster distributed protocol for constructing a minimum spanning tree Michael Elkin
1309
Maximizing data locality in distributed systems Fan Chung, Ronald Graham, Ranjita Bhagwan, Stefan Savage, Geoffrey M. Voelker
1317
Complexity of reachability problems for finite discrete dynamical systems Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S.S. Ravi, Daniel J. Rosenkrantz, Richard E. Stearns
1346
Strong computational lower bounds via parameterized complexity Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
1368
Construction universality in purely asynchronous cellular automata Yousuke Takada, Teijiro Isokawa, Ferdinand Peper, Nobuyuki Matsui
1386
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
1397
DELFIN+ : An efficient deadlock detection tool for CCS processes Sara Gradara, Antonella Santone, Maria Luisa Villani
1413
Papers to appear in forthcoming issues
1414
Volume Author Index
Real-valued multiple-instance learning with queries Daniel R. Dooly, Sally A. Goldman, Stephen S. Kwek
16
An improved approximation algorithm for vertex cover with hard capacities Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan
34
Bounded fixed-parameter tractability and log2 n nondeterministic bits Jörg Flum, Martin Grohe, Mark Weyer
72
The subsumption lattice and query learning Roni Khardon, Marta Arias
95
Sequential predictions based on algorithmic complexity Marcus Hutter
118
Minimizing maximum fiber requirement in optical networks Matthew Andrews, Lisa Zhang
132
Optimal preemptive scheduling for general target functions Leah Epstein, Tamir Tassa
163
The many faces of a translation Pierre McKenzie, Thomas Schwentick, Denis Therien, Heribert Vollmer
180
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS G. Geeraerts, J.-F. Raskin, L. Van Begin
204
Papers to appear in forthcoming issues
Number 2, March 2006 Special Issue on FOCS 2003 Guest Editors: Chandra Chekuri and Daniele Micciancio 205
Foreword Chandra Chekuri, Daniele Micciancio
206
Hardness of approximating the Shortest Vector Problem in high p norms Subhash Khot
220
Polynomial degree vs. quantum query complexity Andris Ambainis
239
On certain connectivity properties of the internet topology Milena Mihail, Christos Papadimitriou, Amin Saberi
252
Symmetric polynomials over Z m and simultaneous communication protocols Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
286
Logics for reasoning about cryptographic constructions Russell Impagliazzo, Bruce M. Kapron
321
Lower bounds for non-black-box zero knowledge Boaz Barak, Yehuda Lindell, Salil Vadhan
392
Simulated annealing in convex bodies and an O ∗ (n4 ) volume algorithm László Lovász, Santosh Vempala
418
Papers to appear in forthcoming issues
Number 3, May 2006 Special Issue on Network Algorithms 2005 Guest Editor: Fan Chung Graham 419
Foreword Fan Chung Graham
420
A brief overview of network algorithms Fan Chung Graham
425
Approximation algorithms for hierarchical location problems C. Greg Plaxton
444
How much can taxes help selfish routing? Richard Cole, Yevgeniy Dodis, Tim Roughgarden
468
Meet and merge: Approximation algorithms for confluent flows Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram
490
Radio communication in random graphs R. Elsässer, L. Gasieniec ˛
507
Papers to appear in forthcoming issues
Number 4, June 2006 509
TSP with bounded metrics Lars Engebretsen, Marek Karpinski
547
A parametric analysis of the state-explosion problem in model checking S. Demri, F. Laroussinie, Ph. Schnoebelen
576
Uniform generation in spatial constraint databases and applications David Gross-Amblard, Michel de Rougemont
592
Average probe complexity in quorum systems Yehuda Hassin, David Peleg
617
Infinite-state high-level MSCs: Model-checking and realizability Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun
648
Sublogarithmic approximation for telephone multicast Michael Elkin, Guy Kortsarz
660
LWPP and WPP are not uniformly gap-definable Holger Spakowski, Rahul Tripathi
690
Security of the design of time-stamped signatures Zuhua Shao
706
A distributed multiple dimensional QoS constrained resource scheduling optimization policy in computational grid Li Chunlin, Li Layuan
727
A password authentication scheme over insecure networks I-En Liao, Cheng-Chi Lee, Min-Shiang Hwang
741
Fuzzy LINMAP method for multiattribute decision making under fuzzy environments Hui-Cheng Xia, Deng-Feng Li, Ji-Yan Zhou, Jian-Ming Wang
760
Dimension, entropy rates, and compression John M. Hitchcock, N.V. Vinodchandran Corrigendum
783
Corrigendum to “Completeness results for graph isomorphism” [J. Comput. System Sci. 66 (2003) 549–566] Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán
784
Papers to appear in forthcoming issues
Number 5, August 2006 Special Issue on FOCS 2001 Guest Editor: Moses Charikar 785
Guest editor’s foreword Moses Charikar
786
Extractors from Reed–Muller codes Amnon Ta-Shma, David Zuckerman, Shmuel Safra
813
Fully dynamic all pairs shortest paths with real edge weights Camil Demetrescu, Giuseppe F. Italiano
838
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems Lisa Fleischer, Kamal Jain, David P. Williamson
868
Planar graphs, negative weight edges, shortest paths, and near linear time Jittat Fakcharoenphol, Satish Rao
890
Ramsey-type theorems for metric spaces with applications to online problems Yair Bartal, Béla Bollobás, Manor Mendel
922
On the severity of Braess’s Paradox: Designing networks for selfish users is hard Tim Roughgarden
954
Papers to appear in forthcoming issues
Number 6, September 2006 955
Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions Yogish Sabharwal, Nishant Sharma, Sandeep Sen
978
Provably secure threshold password-authenticated key exchange Mario Di Raimondo, Rosario Gennaro
1002
Password-based authentication and key distribution protocols with perfect forward secrecy Hung-Min Sun, Her-Tyan Yeh
1012
Tolerant property testing and distance approximation Michal Parnas, Dana Ron, Ronitt Rubinfeld
1043
Error-bounded probabilistic computations between MA and AM Elmar Böhler, Christian Glaßer, Daniel Meister
1077
Inoculation strategies for victims of viruses and the sum-of-squares partition problem James Aspnes, Kevin Chang, Aleksandr Yampolskiy
1094
Optimal rate-based scheduling on multiprocessors Anand Srinivasan, James H. Anderson
Number 7, November 2006 Special Issue: Performance modelling and evaluation of computer systems Guest Editor: Irfan Awan 1119
Performance modelling and evaluation of computer systems Irfan Awan
1121
An analytical model for loss estimation in network traffic analysis systems Armando Ferro, Igor Delgado, Alex Muñoz, Fidel Liberal
1134
Systematic performance modeling and characterization of heterogeneous IP networks Alessio Botta, Donato Emma, Antonio Pescapé, Giorgio Ventre
1144
Clustering overhead and convergence time analysis of the mobility-based multi-hop clustering algorithm for mobile ad hoc networks Inn Inn Er, Winston K.G. Seah
1156
Determining model accuracy of network traces Almudena Konrad, Ben Y. Zhao, Anthony D. Joseph
1172
Performance evaluation for self-healing distributed services and fault detection mechanisms E. Grishikashvili Pereira, R. Pereira, A. Taleb-Bendiab
1183
Performance evaluation of an intelligent CAC and routing framework for multimedia applications in broadband networks Makoto Ikeda, Leonard Barolli, Akio Koyama, Arjan Durresi, Giuseppe De Marco, Jiro Iwashige
1201
Prediction of short-lived TCP transfer latency on bandwidth asymmetric links Guang Tan, Stephen A. Jarvis
1211
HAMS: Scalable peer-to-peer multimedia streaming model in heterogeneous networks Satoshi Itaya, Naohiro Hayashibara, Tomoya Enokido, Makoto Takizawa
1226
A tentative commit protocol for composite web services Muhammad Younas, Kuo-Ming Chao
1238
Control of queueing delay in a buffer with time-varying arrival rate L. Guan, M.E. Woodward, I.U. Awan
1249
Papers to appear in forthcoming issues
Number 8, December 2006 Research Note 1251
Technical note: Replication graphs revisited Jon Grov, Ragnar Normann Regular Articles
1262
Robust gossiping with an application to consensus Bogdan S. Chlebus, Dariusz R. Kowalski
1282
A faster distributed protocol for constructing a minimum spanning tree Michael Elkin
1309
Maximizing data locality in distributed systems Fan Chung, Ronald Graham, Ranjita Bhagwan, Stefan Savage, Geoffrey M. Voelker
1317
Complexity of reachability problems for finite discrete dynamical systems Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S.S. Ravi, Daniel J. Rosenkrantz, Richard E. Stearns
1346
Strong computational lower bounds via parameterized complexity Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
1368
Construction universality in purely asynchronous cellular automata Yousuke Takada, Teijiro Isokawa, Ferdinand Peper, Nobuyuki Matsui
1386
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
1397
DELFIN+ : An efficient deadlock detection tool for CCS processes Sara Gradara, Antonella Santone, Maria Luisa Villani
1413
Papers to appear in forthcoming issues
1414
Volume Author Index