default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 130
Volume 130, Number 1, 10 October 1996
- Stephen A. Fenner, Lance Fortnow, Lide Li:
Gap-Definability as a Closure Property. 1-17 - Sanjay Jain, Arun Sharma
:
Computational Limits on Team Identification of Languages. 19-60 - Thomas Wilke, Haiseung Yoo:
Computing the Rabin Index of a Regular Language of Infinite Words. 61-70 - Parosh Aziz Abdulla, Bengt Jonsson:
Undecidable Verification Problems for Programs with Unreliable Channels. 71-90 - Carsten Damm, Markus Holzer:
Inductive Counting for Width-Restricted Branching Programs. 91-99
Volume 130, Number 2, 1 November 1996
- Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa:
Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata. 101-129 - Farn Wang:
Parametric Timing Analysis for Real-Time Systems. 131-150 - Raffaele Giancarlo, Roberto Grossi:
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications. 151-182 - Véronique Bruyère, Clelia de Felice:
Any Lifting of a Trace Coding is a Word Coding. 183-193
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.
last updated on 2024-12-26 00:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
