Journals in DBLP

Acta Inf.
1993, volume: 30, number: 5

1. David Spuler
   The Optimal Binary Search Tree for Andersson's Search Algorithm. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1993, v:30, n:5, pp:405-407 [Journal]
   
2. Edward G. Coffman Jr., Leopold Flatto, A. Y. Kreinin
   Scheduling Saves in Fault-Tolerant Computations. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1993, v:30, n:5, pp:409-423 [Journal]
   
3. Walid G. Aref, Hanan Samet
   Decomposing a Window into Maximal Quadtree Blocks. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1993, v:30, n:5, pp:425-439 [Journal]
   
4. Alexandru Mateescu, Arto Salomaa
   On Simplest Possible Solutions for Post Correspondence Problems. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1993, v:30, n:5, pp:441-457 [Journal]
   
5. Luc Devroye
   On the Expected Height of Fringe-Balanced Trees. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1993, v:30, n:5, pp:459-466 [Journal]
   
6. K. Narayan Kumar, Paritosh K. Pandya
   Infinitary Parallelism without Unbounded Nondeterminism in CSP. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1993, v:30, n:5, pp:467-487 [Journal]
   
7. Jan Van den Bussche
   On Minimizing the Forall-Not Degree of a Connective-Free Formula. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1993, v:30, n:5, pp:489-502 [Journal]