| 339 | -- | 0 | Wolfgang Maass. Editor s Foreword |
| 341 | -- | 358 | Yair Bartal, Amos Fiat, Yuval Rabani. Competitive Algorithms for Distributed Data Management |
| 359 | -- | 366 | Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra. New Algorithms for an Ancient Scheduling Problem |
| 367 | -- | 373 | Avrim Blum, Steven Rudich. Fast Learning of k-Term DNF Formulas with Queries |
| 374 | -- | 389 | Michael T. Goodrich. Planar Separators and Parallel Polygon Triangulation |
| 390 | -- | 399 | Jeff Kahn, Jeong Han Kim. Entropy and Sorting |
| 400 | -- | 403 | Raimund Seidel. On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs |
| 405 | -- | 432 | Tomasz Imielinski, Ron van der Meyden, Kumar V. Vadaparty. Complexity Tailored Design: A New Design Methodology for Databases With Incomplete Information |
| 433 | -- | 455 | Serge Abiteboul, Paris C. Kanellakis, Sridhar Ramaswamy, Emmanuel Waller. Method Schemas |
| 456 | -- | 459 | Changho Seo, Jongin Lim, Hichum Eun. On Comparison and Analysis of Algorithms for Multiplication in GF(2^m) |
| 460 | -- | 471 | Jirí Adámek, Evelyn Nelson, Jan Reiterman. Continuous Algebras Revisited |
| 472 | -- | 485 | Konstantin Skodinis, Egon Wanke. Emptiness Problems of eNCE Graph Languages |
| 486 | -- | 494 | Camino R. Vela, Antonio Bahamonde. The Best Nondeterministic Representations of Finite Orderings |
| 495 | -- | 502 | Yosi Ben-Asher, Ilan Newman. Decision Trees with Boolean Threshold Queries |
| 503 | -- | 510 | Takao Asano. An O(n log log n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees |
| 511 | -- | 522 | Nadia Creignou. A Dichotomy Theorem for Maximum Generalized Satisfiability Problems |
| 523 | -- | 535 | Jan Chomicki, Damian Niwinski. On the Feasibility of Checking Temporal Integrity Constraints |