The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
George Havas: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Zbigniew J. Czech, George Havas, Bohdan S. Majewski
    An Optimal Algorithm for Generating Minimal Perfect Hash Functions. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:5, pp:257-264 [Journal]
  2. David Ford, George Havas
    A New Algorithm and Refined Bounds for Extended Gcd Computation. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:145-150 [Conf]
  3. Bohdan S. Majewski, George Havas
    The complexity of greatest common divisor computations. [Citation Graph (0, 0)][DBLP]
    ANTS, 1994, pp:184-193 [Conf]
  4. Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor Shparlinski
    On Routing in Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:360-369 [Conf]
  5. Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas
    GCD of Many Integers. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:310-317 [Conf]
  6. Weifa Liang, George Havas
    NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:430-439 [Conf]
  7. George Havas, Leon Sterling
    Integer matrices and Abelian groups (invited). [Citation Graph (0, 0)][DBLP]
    EUROSAM, 1979, pp:431-451 [Conf]
  8. Weifa Liang, George Havas, Xiaojun Shen
    Improved Lightpath (Wavelength) Routing in Large WDM Networks. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1998, pp:516-523 [Conf]
  9. S. A. M. Makki, George Havas
    Distributed Algorithms for Constructing a Depth-First-Search Tree. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1994, pp:270-273 [Conf]
  10. George Havas, Jin Xian Lian
    A New Problem in String Searching. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:660-668 [Conf]
  11. George Havas, Bohdan S. Majewski
    A Hard Problem That is Almost Always Easy. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:216-223 [Conf]
  12. Xin Gui Fang, George Havas
    On the Worst-case Complexity of Integer Gaussian Elimination. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1997, pp:28-31 [Conf]
  13. George Havas
    Coset Enumeration Strategies. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1991, pp:191-199 [Conf]
  14. Bohdan S. Majewski, George Havas
    A Solution to the Extended GCD Problem. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1995, pp:248-253 [Conf]
  15. George Havas, Jean-Pierre Seifert
    The Complexity of the Extended GCD Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:103-113 [Conf]
  16. S. A. M. Makki, George Havas
    An Efficient Method for Constructing a Distributed Depth-First Search Tree. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1997, pp:660-666 [Conf]
  17. George Havas, Clemens Wagner 0002
    Some Performance Studies in Exact Linear Algebra. [Citation Graph (0, 0)][DBLP]
    Wide Area Networks and High Performance Computing, 1998, pp:161-170 [Conf]
  18. George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech
    Graphs, Hypergraphs and Hashing. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:153-165 [Conf]
  19. John J. Cannon, George Havas
    Algorithms for Groups. [Citation Graph (0, 0)][DBLP]
    Australian Computer Journal, 1992, v:24, n:2, pp:51-60 [Journal]
  20. George Havas
    Hyperdisk, an access method for remote disk devices. [Citation Graph (0, 0)][DBLP]
    Australian Computer Journal, 1981, v:13, n:2, pp:64-65 [Journal]
  21. Bohdan S. Majewski, Nicholas C. Wormald, George Havas, Zbigniew J. Czech
    A Family of Perfect Hashing Methods. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1996, v:39, n:6, pp:547-554 [Journal]
  22. Xin Gui Fang, George Havas, Jie Wang
    A Family of Non-quasiprimitive Graphs Admitting a Quasiprimitive 2-arc Transitive Group Action. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:6, pp:551-557 [Journal]
  23. George Havas
    On the Complexity of the Extended Euclidean Algorithm (extended abstract). [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:78, n:, pp:- [Journal]
  24. George Havas, Michael R. Vaughan-Lee
    4-Engel Groups are Locally Nilpotent. [Citation Graph (0, 0)][DBLP]
    IJAC, 2005, v:15, n:4, pp:649-682 [Journal]
  25. George Havas, Colin Ramsay
    Breadth-First Search and the Andrews-Curtis Conjecture. [Citation Graph (0, 0)][DBLP]
    IJAC, 2003, v:13, n:1, pp:61-68 [Journal]
  26. S. A. M. Makki, George Havas
    Distributed Algorithms for Depth-First Search. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:1, pp:7-12 [Journal]
  27. George Havas
    Bohdan S. Majewski: Integer Matrix Diagonalization. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1997, v:24, n:3/4, pp:399-408 [Journal]
  28. George Havas, M. F. Newman, Michael R. Vaughan-Lee
    A Nilpotent Quotient Algorithm for Graded Lie Rings. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:9, n:5/6, pp:653-664 [Journal]
  29. Zbigniew J. Czech, George Havas, Bohdan S. Majewski
    Perfect Hashing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:182, n:1-2, pp:1-143 [Journal]

  30. Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.007secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002