Journal: J. Comput. Syst. Sci.

Volume 68, Issue 4

701 -- 0Edith Cohen, Venkatesan Guruswami. Guest Editors foreword
702 -- 732Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar. An information statistics approach to data stream and communication complexity
733 -- 752Jon Feldman, David R. Karger. Decoding turbo-like codes via linear programming
753 -- 787Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky. Testing juntas
788 -- 807Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli. Implicit ::::B::::-trees: a new data structure for the dictionary problem
808 -- 840Adam R. Klivans, Ryan O Donnell, Rocco A. Servedio. Learning intersections and thresholds of halfspaces
841 -- 860Santosh Vempala, Grant Wang. A spectral algorithm for learning mixture models

Volume 68, Issue 3

473 -- 496Narayan Vikas. Computational complexity of compaction to irreflexive cycles
497 -- 520Wojciech Palacz. Algebraic hierarchical graph transformation
521 -- 545Pirkko Kuusela, Daniel Ocone. Learning with side information: PAC learning bounds
546 -- 597Etienne Grandjean, Frédéric Olive. Graph properties checkable in linear time in the number of vertices
598 -- 610Hung-Min Sun, Bing-Chang Chen, Her-Tyan Yeh. On the design of time-stamped signatures
611 -- 656Frank Drewes, Joost Engelfriet. Branching synchronization grammars with nested tables
657 -- 674Christopher M. Homan. Tight lower bounds on the ambiguity of strong, total, associative, one-way functions
675 -- 699Pavol Duris, Juraj Hromkovic, Katsushi Inoue. On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata

Volume 68, Issue 2

237 -- 0Sampath Kannan, Mihalis Yannakakis. Guest Editors foreword
238 -- 268Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy. A sharp threshold in proof complexity yields lower bounds for satisfiability search
269 -- 284Bernard Chazelle, Ding Liu. Lower bounds for intersection searching and fractional cascading in higher dimension
285 -- 302Martin Grohe. Computing crossing numbers in quadratic time
303 -- 318Adam R. Klivans, Rocco A. Servedio. Learning DNF in time 2:::Õ(n:::1/3:::):::
319 -- 334Marcus Schaefer, Daniel Stefankovic. Decidability of string graphs
335 -- 373John Dunagan, Santosh Vempala. Optimal outlier removal in high-dimensional spaces
374 -- 397Luca de Alfaro, Rupak Majumdar. Quantitative solution of omega-regular games
398 -- 416Andris Ambainis. A new protocol and lower bounds for quantum coin flipping
417 -- 441Moses Charikar, Rina Panigrahy. Clustering to minimize the sum of cluster diameters
442 -- 470Michel X. Goemans, David P. Williamson. Approximation algorithms for M::AX::-3-C::UT:: and other problems via complex semidefinite programming

Volume 68, Issue 1

1 -- 21Alexandru Mateescu, Arto Salomaa, Sheng Yu. Subword histories and Parikh matrices
22 -- 40Kwok Pui Choi, Louxin Zhang. Sensitivity analysis and efficient method for identifying optimal spaced seeds
41 -- 79Ngoc-Minh Lê. Abstract Voronoi diagram in 3-space
80 -- 95Luca Becchetti, Stefano Leonardi, S. Muthukrishnan. Average stretch without migration
96 -- 114Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte. Randomness and reducibility
115 -- 122Deng-Feng Li. Some measures of dissimilarity in intuitionistic fuzzy structures
123 -- 133Emmanuelle Anceaume, Antonio Fernández, Achour Mostéfaoui, Gil Neiger, Michel Raynal. A necessary and sufficient condition for transforming limited accuracy failure detectors
134 -- 156Wolfgang Merkle, Frank Stephan. Trees and learning
157 -- 204James H. Anderson, Anand Srinivasan. Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
205 -- 234Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon. More efficient PAC-learning of DNF with membership queries under the uniform distribution