default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 134
Volume 134, Number 1, April 10, 1997
- Francesco M. Donini
, Maurizio Lenzerini, Daniele Nardi, Werner Nutt:
The Complexity of Concept Languages. 1-58 - Vivek Gore, Mark Jerrum, Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney:
A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free Language. 59-74
Volume 134, Number 2, May 1, 1997
- Kim Guldstrand Larsen, Wang Yi:
Time-abstracted Bisimulation: Implicit Specifications and Decidability. 75-101 - Zvi Galil, Oded Margalit:
All Pairs Shortest Distances for Graphs with Small Integer Length Edges. 103-139
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-03-01 15:15 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:
