default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformatique Théorique et Applications, Volume 30
Volume 30, Number 1, 1996
- Eric Allender, Mitsunori Ogihara:
Relationships Among PL, #L, and the Determinant. 1-21 - Victor J. Rayward-Smith, Djamal Rebaine:
Uet Flow Shop Scheduling with Delays. 23-30 - E. Lippe, Arthur H. M. ter Hofstede
:
A Category Theory Approach to Conceptual Data Modeling. 31-79 - John Michael Robson:
Separating Words with Machines and Groups. 81-86
Volume 30, Number 2, 1996
- Antoni Lozano:
Bounded Queries to Arbitrary Sets. 91-100 - Jorge Castro, Carlos Seara:
Complexity Classes Between ThetaPk and DeltaPk . 101-121 - Ronald V. Book, Elvira Mayordomo:
On the Robustness of ALMOST-R. 123-133 - Thomas Thierauf, Seinosuke Toda, Osamu Watanabe:
On Sets Bounded Truth-Table Reducible to P-Selective Sets. 135-154 - Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
Monotonous and Randomized Reductions to Sparse Sets. 155-179
Volume 30, Number 3, 1996
- Bertrand Le Saëc, Igor Litovsky, Bruno Patrou:
A More Efficient Notion of Zigzag Stability. 181-194 - Michael Cramer:
A Note Concerning the Limit Distribution of the Quicksort Algorithm. 195-207 - Nami Kobayashi:
The Closure Under Division and a Characterization of the Recognizable Z-Subsets. 209-230 - Mehmet A. Orgun:
Incorporating an Implicit Time Dimension Into the Relational Model and Algebra. 231-260 - Karim Nour:
Opérateurs de mise en mémoire et types forall-positifs. 261-293
Volume 30, Number 4, 1996
- Dominique Geniet, René Schott, Loÿs Thimonier:
A Markovian Concurrency Measure. 295-304 - Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela:
Average Case Analysis of Fully Dynamic Reachability for Directed Graphs. 305-318 - Lionel Ducos:
Algorithme de Bareiss, algorithme des sous-résultants. 319-347 - Pedro V. Silva:
On Free Inverse Monoid Languages. 349-378
Volume 30, Number 5, 1996
- Andreas Weber:
Decomposing A k-Valued Transducer into k Unambiguous Ones. 379-413 - Winfried Kurth:
One-Rule Semi-Thue Systems with Loops of Length One, Two or Three. 415-429 - Pierluigi Crescenzi, Luca Trevisan:
On the Distributed Decision-Making Complexity of the Minimum Vertex Cover Problem. 431-441 - Luc Devroye, Paul Kruszewski:
On the Horton-Strahler Number for Random Tries. 443-456 - Francine Blanchet-Sadri:
On Semidirect and Two-Sided Semidirect Products of Finite J-Trivial Monoids. 457-482
Volume 30, Number 6, 1996
- Nguyen Huong Lam:
On Codes Having no Finite Completion. 483-493 - L. Dubuc:
Les automates circulaires biaisés vérifient la conjecture de Cerný. 495-505 - Markus E. Nebel:
Digital Search Trees with Keys of Variable Length. 507-520 - Dany Breslauer, Leszek Gasieniec:
Efficient String Matching on Packed Texts. 521-544 - Rainer Kemp:
On the Average Minimal Prefix-Length of the Generalized Semi-Dycklanguage. 545-561
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 2025-12-15 22:55 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:
