JCSS,
Volume 68
Volume 68,
Number 1,
February 2004
- Alexandru Mateescu, Arto Salomaa, Sheng Yu:
Subword histories and Parikh matrices.
1-21
Electronic Edition (link) BibTeX
- Kwok Pui Choi, Louxin Zhang:
Sensitivity analysis and efficient method for identifying optimal spaced seeds.
22-40
Electronic Edition (link) BibTeX
- Ngoc-Minh Lê:
Abstract Voronoi diagram in 3-space.
41-79
Electronic Edition (link) BibTeX
- Luca Becchetti, Stefano Leonardi, S. Muthukrishnan:
Average stretch without migration.
80-95
Electronic Edition (link) BibTeX
- Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte:
Randomness and reducibility.
96-114
Electronic Edition (link) BibTeX
- Deng-Feng Li:
Some measures of dissimilarity in intuitionistic fuzzy structures.
115-122
Electronic Edition (link) BibTeX
- Emmanuelle Anceaume, Antonio Fernández, Achour Mostéfaoui, Gil Neiger, Michel Raynal:
A necessary and sufficient condition for transforming limited accuracy failure detectors.
123-133
Electronic Edition (link) BibTeX
- Wolfgang Merkle, Frank Stephan:
Trees and learning.
134-156
Electronic Edition (link) BibTeX
- James H. Anderson, Anand Srinivasan:
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks.
157-204
Electronic Edition (link) BibTeX
- Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon:
More efficient PAC-learning of DNF with membership queries under the uniform distribution.
205-234
Electronic Edition (link) BibTeX
Volume 68,
Number 2,
March 2004
Special Issue on STOC 2001
- Sampath Kannan, Mihalis Yannakakis:
Guest Editors' foreword.
237
Electronic Edition (link) BibTeX
- Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy:
A sharp threshold in proof complexity yields lower bounds for satisfiability search.
238-268
Electronic Edition (link) BibTeX
- Bernard Chazelle, Ding Liu:
Lower bounds for intersection searching and fractional cascading in higher dimension.
269-284
Electronic Edition (link) BibTeX
- Martin Grohe:
Computing crossing numbers in quadratic time.
285-302
Electronic Edition (link) BibTeX
- Adam R. Klivans, Rocco A. Servedio:
Learning DNF in time 2Õ(n1/3).
303-318
Electronic Edition (link) BibTeX
- Marcus Schaefer, Daniel Stefankovic:
Decidability of string graphs.
319-334
Electronic Edition (link) BibTeX
- John Dunagan, Santosh Vempala:
Optimal outlier removal in high-dimensional spaces.
335-373
Electronic Edition (link) BibTeX
- Luca de Alfaro, Rupak Majumdar:
Quantitative solution of omega-regular games.
374-397
Electronic Edition (link) BibTeX
- Andris Ambainis:
A new protocol and lower bounds for quantum coin flipping.
398-416
Electronic Edition (link) BibTeX
- Moses Charikar, Rina Panigrahy:
Clustering to minimize the sum of cluster diameters.
417-441
Electronic Edition (link) BibTeX
- Michel X. Goemans, David P. Williamson:
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming.
442-470
Electronic Edition (link) BibTeX
Volume 68,
Number 3,
May 2004
- Narayan Vikas:
Computational complexity of compaction to irreflexive cycles.
473-496
Electronic Edition (link) BibTeX
- Wojciech Palacz:
Algebraic hierarchical graph transformation.
497-520
Electronic Edition (link) BibTeX
- Pirkko Kuusela, Daniel Ocone:
Learning with side information: PAC learning bounds.
521-545
Electronic Edition (link) BibTeX
- Etienne Grandjean, Frédéric Olive:
Graph properties checkable in linear time in the number of vertices.
546-597
Electronic Edition (link) BibTeX
- Hung-Min Sun, Bing-Chang Chen, Her-Tyan Yeh:
On the design of time-stamped signatures.
598-610
Electronic Edition (link) BibTeX
- Frank Drewes, Joost Engelfriet:
Branching synchronization grammars with nested tables.
611-656
Electronic Edition (link) BibTeX
- Christopher M. Homan:
Tight lower bounds on the ambiguity of strong, total, associative, one-way functions.
657-674
Electronic Edition (link) BibTeX
- Pavol Duris, Juraj Hromkovic, Katsushi Inoue:
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata.
675-699
Electronic Edition (link) BibTeX
Volume 68,
Number 4,
June 2004
Special Issue on FOCS 2002
- Edith Cohen, Venkatesan Guruswami:
Guest Editors' foreword.
701
Electronic Edition (link) BibTeX
- Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar:
An information statistics approach to data stream and communication complexity.
702-732
Electronic Edition (link) BibTeX
- Jon Feldman, David R. Karger:
Decoding turbo-like codes via linear programming.
733-752
Electronic Edition (link) BibTeX
- Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky:
Testing juntas.
753-787
Electronic Edition (link) BibTeX
- Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli:
Implicit B-trees: a new data structure for the dictionary problem.
788-807
Electronic Edition (link) BibTeX
- Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio:
Learning intersections and thresholds of halfspaces.
808-840
Electronic Edition (link) BibTeX
- Santosh Vempala, Grant Wang:
A spectral algorithm for learning mixture models.
841-860
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:08:16 2009
by Michael Ley (ley@uni-trier.de)
