


default search action
Theory of Computing Systems, Volume 44
Volume 44, Number 1, January 2009
- Keisuke Nakano

:
Composing Stack-Attributed Tree Transducers. 1-38 - Victor Luchangco, Mark Moir, Nir Shavit:

Nonblocking k -Compare-Single-Swap. 39-66 - Leah Epstein

, Rob van Stee, Tami Tamir:
Paging with Request Sets. 67-81 - Heribert Vollmer:

The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis. 82-90 - Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter:

Applying Modular Decomposition to Parameterized Cluster Editing Problems. 91-104 - Sanpawat Kantabutra, Jakarin Chawachat:

On Embedding of a Hypercube in a Completely Overlapping Network. 105-116 - Michael Bauland, Edith Hemaspaandra:

Isomorphic Implication. 117-139
Volume 44, Number 2, February 2009
- Pierluigi Crescenzi

, Fabrizio Luccio, Geppino Pucci
:
Foreword. 141-142 - Giuseppe Di Battista

, Fabrizio Frati
, Maurizio Patrignani:
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. 143-159 - Helmut Alt, Hans L. Bodlaender

, Marc J. van Kreveld, Günter Rote, Gerard Tel:
Wooden Geometric Puzzles: Design and Hardness Proofs. 160-174 - Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman:

The Worst Page-Replacement Policy. 175-185 - Flaminia L. Luccio

:
Contiguous Search Problem in Sierpinski Graphs. 186-204 - Rudolf Fleischer:

Die Another Day. 205-214 - Michael Lampis, Valia Mitsou:

The Ferry Cover Problem. 215-229 - Kazuo Iwama, Eiji Miyano

, Hirotaka Ono
:
Drawing Borders Efficiently. 230-244 - Ronen Gradwohl

, Moni Naor, Benny Pinkas, Guy N. Rothblum:
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. 245-268 - Paolo Boldi

, Flavio Chierichetti, Sebastiano Vigna
:
Pictures from Mongolia. Extracting the Top Elements from a Partially Ordered Set. 269-288
Volume 44, Number 3, April 2009
- Andy Kwok, Chung Keung Poon

:
Two-Dimensional Packet Classification and Filter Conflict Resolution in the Internet. 289-303 - Maria J. Blesa, Daniel Calzada, Antonio Fernández, Luis López, Andrés L. Martínez, Agustín Santos, Maria J. Serna, Christopher Thraves

:
Adversarial Queueing Model for Continuous Network Dynamics. 304-331 - André Gronemeier, Martin Sauerhoff:

Applying Approximate Counting for Computing the Frequency Moments of Long Data Streams. 332-348 - Minghui Jiang:

A Linear-Time Algorithm for Hamming Distance with Shifts. 349-355 - Takayuki Nagoya:

Computing Graph Automorphism from Partial Solutions. 356-368 - Christian Glaßer, Stephen D. Travers:

Machines that Can Output Empty Words. 369-390 - Detlef Sieling:

Minimization Problems for Parity OBDDs. 391-413 - Yan-Hui Zhai, Kai-She Qu:

On Characteristics of Information System Homomorphisms. 414-431 - Michael Domaratzki

:
Hairpin Structures Defined by DNA Trajectories. 432-454 - Zoltán Fülöp

, Andreas Maletti, Heiko Vogler:
A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. 455-499
Volume 44, Number 4, May 2009
- Thomas Schwentick, Dan Suciu

:
Foreword. 501-502 - Nilesh N. Dalvi:

Query Evaluation on a Database Given by a Random Graph. 503-532 - Martin Grohe

, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz
, Jan Van den Bussche
:
Database Query Processing Using Finite Cursor Machines. 533-560 - Balder ten Cate

, Maarten Marx
:
Axiomatizing the Logical Core of XPath 2.0. 561-589 - Edward L. Robertson, Lawrence V. Saxton, Dirk Van Gucht, Stijn Vansummeren:

Structural Recursion as a Query Language on Lists and Ordered Trees. 590-619 - Jerzy Marcinkowski, Piotr Wieczorek:

Modulo Constraints and the Complexity of Typechecking XML Views. 620-652

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














