Journals in DBLP

Theor. Comput. Sci.
1997, volume: 181, number: 1

1. Ricardo A. Baeza-Yates, Eric Goles Ch.
   Preface to the Special Issue on the 1995 Latin American Theoretical Informatics Symposium. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:1, pp:1-2 [Journal]
   
2. Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer
   Space-Filling Curves and Their Use in the Design of Geometric Data Structures. [Citation Graph (1, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:1, pp:3-15 [Journal]
   
3. Véronique Bruyère, Georges Hansel
   Bertrand Numeration Systems and Recognizability. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:1, pp:17-43 [Journal]
   
4. Shiva Chaudhuri, Devdatt P. Dubhashi
   Probabilistic Recurrence Relations Revisited. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:1, pp:45-56 [Journal]
   
5. David Fernández-Baca, Giora Slutzki
   Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:1, pp:57-74 [Journal]
   
6. Esteban Feuerstein
   Paging More than One Page. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:1, pp:75-90 [Journal]
   
7. Celina M. Herrera de Figueiredo, João Meidanis, Célia Picinin de Mello
   On Edge-Colouring Indifference Graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:1, pp:91-106 [Journal]
   
8. Giulia Galbiati, Angelo Morzenti, Francesco Maffioli
   On the Approximability of Some Maximum Spanning Tree Problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:1, pp:107-118 [Journal]
   
9. William I. Gasarch, Katia S. Guimarães
   Binary Search and Recursive Graph Problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:1, pp:119-139 [Journal]
   
10. Christian Herzog
    Pushdown Automata with Bounded Nondeterminism and Bounded Ambiguity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:1, pp:141-157 [Journal]
    
11. Daniel P. Lopresti, Andrew Tomkins
    Block Edit Models for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:1, pp:159-179 [Journal]
    
12. Helmut Prodinger
    On a Problem of Yekutieli and Mandelbrot about the Bifurcation Ratio of Binary Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:1, pp:181-194 [Journal]
    
13. Farn Wang
    A Temporal Logic for Real-Time Partial Ordering with Named Transactions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:1, pp:195-225 [Journal]