Mixed computation: potential applications and problems for study

JOURNAL ARTICLE published April 1982 in Theoretical Computer Science

Authors: A.P. Ershov

Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations

JOURNAL ARTICLE published June 1999 in Theoretical Computer Science

Authors: Ahmed Bouajjani | Peter Habermehl

Multiplication, division, and shift instructions in parallel random access machines

JOURNAL ARTICLE published June 1992 in Theoretical Computer Science

Authors: Jerry L. Trahan | Michael C. Loui | Vijaya Ramachandran

Guarded fixed point logics and the monadic theory of countable trees

JOURNAL ARTICLE published October 2002 in Theoretical Computer Science

Authors: Erich Grädel

Models of approximation in databases

JOURNAL ARTICLE published January 1998 in Theoretical Computer Science

Authors: Leonid Libkin

Efficiently computing succinct trade-off curves

JOURNAL ARTICLE published December 2005 in Theoretical Computer Science

Authors: Sergei Vassilvitskii | Mihalis Yannakakis

Semantics of types for database objects

JOURNAL ARTICLE published October 1990 in Theoretical Computer Science

Authors: Atsushi Ohori

Bounded fixpoints for complex objects

JOURNAL ARTICLE published April 1997 in Theoretical Computer Science

Authors: Dan Suciu

Unifying concurrency control and recovery of transactions with semantically rich operations

JOURNAL ARTICLE published January 1998 in Theoretical Computer Science

Authors: R. Vingralek | H. Hasse-Ye | Y. Breitbart | H.-J. Schek

The mixed powerdomain

JOURNAL ARTICLE published September 1992 in Theoretical Computer Science

Authors: Carl A. Gunter

Finite-automaton aperiodicity is PSPACE-complete

JOURNAL ARTICLE published September 1991 in Theoretical Computer Science

Authors: Sang Cho | Dung T. Huynh

On time-space classes and their relation to the theory of real addition

JOURNAL ARTICLE published May 1980 in Theoretical Computer Science

Authors: Anna R. Bruss | Albert R. Meyer

Queries with arithmetical constraints

JOURNAL ARTICLE published February 1997 in Theoretical Computer Science

Authors: Stéphane Grumbach | Jianwen Su

The complexity of presburger arithmetic with bounded quantifier alternation depth

JOURNAL ARTICLE published April 1982 in Theoretical Computer Science

Authors: Martin Fürer

Tight lower bounds for query processing on streaming and external memory data

JOURNAL ARTICLE published June 2007 in Theoretical Computer Science

Authors: Martin Grohe | Christoph Koch | Nicole Schweikardt

A gap property of deterministic tree languages

JOURNAL ARTICLE published June 2003 in Theoretical Computer Science

Authors: Damian Niwiński | Igor Walukiewicz

Bottom-up evaluation and query optimization of well-founded models

JOURNAL ARTICLE published July 1995 in Theoretical Computer Science

Authors: David B. Kemp | Divesh Srivastava | Peter J. Stuckey

Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping

JOURNAL ARTICLE published December 2020 in Theoretical Computer Science

Authors: Christian Komusiewicz | Mateus de Oliveira Oliveira | Meirav Zehavi

Detecting induced minors in AT-free graphs

JOURNAL ARTICLE published April 2013 in Theoretical Computer Science

Authors: Petr A. Golovach | Dieter Kratsch | Daniël Paulusma

Computing a metric basis of a bipartite distance-hereditary graph

JOURNAL ARTICLE published January 2022 in Theoretical Computer Science

Authors: Marina Moscarini