default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 147
Volume 147, Numbers 1&2, 7 August 1995
- Evripidis Bampis, Jean-Claude König, Denis Trystram:
Optimal Parallel Execution of Complete Binary Trees and Grids Into Most Popular Interconnection Networks. 1-18 - Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter:
The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching. 19-30 - Hans L. Bodlaender
, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham:
The Parameterized Complexity of Sequence Alignment and Consensus. 31-54 - Claude Sureson:
NP != co-NP and Models of Arithmetic. 55-67 - Klaus Jansen, Haiko Müller:
The Minimum Broadcast Time Problem for Several Processor Networks. 69-85 - Taishin Y. Nishida:
Quasi-Deterministic 0L Systems and Their Representation. 87-116 - Allan Cheng, Javier Esparza, Jens Palsberg:
Complexity Results for 1-Safe Nets. 117-136 - Marius Zimand:
On the Topological Size of p-m-Complete Degrees. 137-147 - Gerhard Schurz:
Most General First Order Theorems are not Recursively Enumerable. 149-163 - Philippe Aigrain, Danièle Beauquier:
Polyomino Tilings, Cellular Automata and Codicity. 165-180 - Edoardo Amaldi, Viggo Kann:
The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations. 181-210 - Didier Arquès, Olivier Grange:
A Fast Scan-Line Algorithm For Topological Filling Of Well-Nested Objects in 2.5D Digital Pictures. 211-248 - Chang-Wu Yu, Gen-Huey Chen:
Efficient Parallel Algorithms for Doubly Convex-Bipartite Graphs. 249-265 - Joël Blot, Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad:
Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems. 267-298
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-02-15 00:20 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:
