The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
1995, volume: 24, number: 2

  1. Joseph Cheriyan, Torben Hagerup
    A Randomized Maximum-Flow Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:203-226 [Journal]
  2. B. K. Natarajan
    Sparse Approximate Solutions to Linear Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:227-234 [Journal]
  3. Qingzhou Wang, Ernst L. Leiss
    A Heuristic Scheduling of Independent Tasks with Bottleneck Resource Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:235-241 [Journal]
  4. Dima Grigoriev, Michael F. Singer, Andrew Chi-Chih Yao
    On Computing Algebraic Functions Using Logarithms and Exponentials. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:242-246 [Journal]
  5. Sanjiv Kapoor, H. Ramesh
    Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:247-265 [Journal]
  6. Faith E. Fich, J. Ian Munro, Patricio V. Poblete
    Permuting in Place. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:266-278 [Journal]
  7. David W. Juedes, Jack H. Lutz
    The Complexity and Distribution of Hard Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:279-295 [Journal]
  8. Michel X. Goemans, David P. Williamson
    A General Approximation Technique for Constrained Forest Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:296-317 [Journal]
  9. Gilad Koren, Dennis Shasha
    D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:318-339 [Journal]
  10. Pekka Kilpeläinen, Heikki Mannila
    Ordered and Unordered Tree Inclusion. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:340-356 [Journal]
  11. Yishay Mansour
    Randomized Interpolation and Approximation of Sparse Polynomials. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:357-368 [Journal]
  12. Arthur L. Delcher, S. Rao Kosaraju
    An NC Algorithm for Evaluating Monotone Planar Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:369-375 [Journal]
  13. Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
    Private Computations over the Integers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:376-386 [Journal]
  14. Yagati N. Lakshman, B. David Saunders
    Sparse Polynomial Interpolation in Nonstandard Bases. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:387-397 [Journal]
  15. Ming Li, Paul M. B. Vitányi
    A New Approach to Formal Language Theory by Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:398-410 [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