Items where Research Area is "Theory and Applications of Algorithms" and Year is 2001

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Creators | Category | No Grouping
Number of items: 5.

  • A low-complexity divide-and-conquer method for computing eigenvalues and eigenvectors of symmetric band matrices
    Gansterer, Wilfried and Schneid, J. and Ueberhuber, C. W. BIT Numerical Mathematics, 41 (5). (2001)

  • Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices
    Gansterer, Wilfried and Ward, R. C. Technical Report. Department of Computer Science, University of Tenessee, USA (2001)

  • Hochleistungsrechnen mit HPF (in German)
    Gansterer, Wilfried and Überhuber, Christoph Springer, Berlin, Germany ISBN 978-3540423669 (2001)

  • Hyperlink analysis for the Web
    Henzinger, Monika Internet Computing, IEEE, 5 (1). 45--50 (2001)

  • Maintaining minimum spanning forests in dynamic graphs
    Henzinger, Monika and King, Valerie SIAM J Comput, 31 (2). 364--374 (2001)

    • This list was generated on Tue Nov 5 04:17:47 2024 CET.
    Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
    EPrints Logo
    CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.