The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1996, volume: 59, number: 1

  1. Gurmeet Singh Manku
    A Linear Time Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:1-7 [Journal]
  2. Stephen Alstrup, Jens Clausen, Kristian Jørgensen
    An O(|V|*|E|) Algorithm for Finding Immediate Multiple-Vertex Dominators. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:9-11 [Journal]
  3. Dietmar Wätjen, Heike Spilker
    Decidability Results Concerning k-limited ED0L Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:13-17 [Journal]
  4. Thomas Natschläger, Michael Schmitt
    Exact VC-Dimension of Boolean Monomials. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:19-20 [Journal]
  5. Ricardo A. Baeza-Yates, Chris H. Perleberg
    Fast and Practical Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:21-27 [Journal]
  6. Uri Zwick
    On the Number of ANDs Versus the Number of ORs in Monotone Boolean Circuits. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:29-30 [Journal]
  7. Yu-Chen Kuo, Shing-Tsaan Huang
    A Simple Scheme to Construct k-Coteries with O(sqrt(N)) Uniform Quorum Sizes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:31-36 [Journal]
  8. Nader H. Bshouty
    A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:37-39 [Journal]
  9. Monika Rauch Henzinger, David P. Williamson
    On the Number of Small Cuts in a Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:41-44 [Journal]
  10. Xiadong Wang, Qingxiang Fu
    A Frame for General Divide-and-Conquer Recurrences. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:45-51 [Journal]
  11. Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert
    Maintaining a Topological Order Under Edge Insertions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:53-58 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002