Journal: Theory Comput. Syst.

Volume 38, Issue 6

671 -- 685Beate Bollig, Philipp Woelfel. A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications
687 -- 700Irene Finocchi, Rossella Petreschi. Structure-Preserving Hierarchical Decompositions
701 -- 729Xizhong Zheng, Robert Rettinger, Romain Gengler. Closure Properties of Real Number Classes under CBV Functions
731 -- 761Richard Edwin Stearns, Harry B. Hunt III. Resource Bounds and Subproblem Independence
763 -- 787Marc Demange, Vangelis Th. Paschos. Improved Approximations for Weighted and Unweighted Graph Problems

Volume 38, Issue 5

539 -- 558Giuseppe Prencipe. The Effect of Synchronicity on the Behavior of Autonomous Mobile Robots
559 -- 571John M. Hitchcock. Correspondence Principles for Effective Dimensions
573 -- 591Frédéric Magniez. Multi-Linearity Self-Testing with Relative Error
593 -- 621Véronique Bruyère, Olivier Carton. Hierarchy Among Automata on Linear Orderings
623 -- 645Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca. New Graph Classes of Bounded Clique-Width
647 -- 668K. Subramani. Tractable Fragments of Presburger Arithmetic

Volume 38, Issue 4

371 -- 372. Foreword
373 -- 392Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier. Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation
393 -- 410Bala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky. Unlocking the Advantages of Dynamic Service Selection and Pricing
411 -- 423Richard Bruce, Michael Hoffmann 0002, Danny Krizanc, Rajeev Raman. Efficient Update Strategies for Geometric Computing with Uncertainty
425 -- 460Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis. The Impact of Network Structure on the Stability of Greedy Protocols
461 -- 479Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong. On-line Stream Merging with Max Span and Min Coverage
481 -- 501Gian Carlo Bongiovanni, Paolo Penna. XOR-Based Schemes for Fast Parallel IP Lookups
503 -- 536Lee-Ad Gottlieb, John E. Savage, Arkady Yerukhimovich. Efficient Data Storage in Large Nanoarrays

Volume 38, Issue 3

251 -- 0. Foreword
253 -- 278Therese C. Biedl, Dana F. Wilkinson. Bounded-Degree Independent Sets in Planar Graphs
279 -- 292Christoph Ambühl, Uli Wagner. The Clique Problem in Intersection Graphs of Ellipses and Triangles
293 -- 311Christoph Buchheim, Seok-Hee Hong. Crossing Minimization for Symmetries
313 -- 327Cesim Erten, Stephen G. Kobourov. Simultaneous Embedding of a Planar Graph and Its Dual on the Grid
329 -- 345Adi Avidor, Uri Zwick. Approximating MIN 2-SAT and MIN 3-SAT
347 -- 367Tomasz Jurdzinski, Grzegorz Stachowiak. Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio Networks

Volume 38, Issue 2

133 -- 0Helmut Alt. Foreword
135 -- 159Pascal Tesson, Denis Thérien. Complete Classifications for the Communication Complexity of Regular Languages
161 -- 169Juhani Karhumäki, Michel Latteux, Ion Petre. Commutation with Ternary Sets of Words
171 -- 188Stefan Szeider. The Complexity of Resolution with Generalized Symmetry Rules
189 -- 209Xizhong Zheng, Robert Rettinger. Effective Jordan Decomposition
211 -- 227Harry Buhrman, Lance Fortnow, Aduri Pavan. Some Results on Derandomization
229 -- 248Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis. Space Efficient Hash Tables with Worst Case Constant Access Time

Volume 38, Issue 1

1 -- 38Manfred Droste, Christian Pech, Heiko Vogler. A Kleene Theorem for Weighted Tree Automata
39 -- 81Dietrich Kuske, Markus Lohrey. Decidable First-Order Theories of One-Step Rewriting in Trace Monoids
83 -- 113Sven Kosub. NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems
115 -- 130Enrico Pontelli, Desh Ranjan. A Simple Optimal Solution for the Temporal Precedence Problem on Pure Pointer Machines