default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorge Havas
Person information
- affiliation: University of Queensland, Brisbane, Australia
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j17]Colin M. Campbell, George Havas, Colin Ramsay, Edmund F. Robertson:
On the Efficiency of the Simple Groups of Order Less Than a Million and Their Covers. Exp. Math. 16(3): 347-358 (2007)- 2005
- [j16]George Havas, Michael R. Vaughan-Lee:
4-Engel Groups are Locally Nilpotent. Int. J. Algebra Comput. 15(4): 649-682 (2005) - 2004
- [j15]Gilbert Baumslag, Sean Cleary, George Havas:
Experimenting with Infinite Groups, I. Exp. Math. 13(4): 495-502 (2004) - [j14]Colin M. Campbell, George Havas, Colin Ramsay, Edmund F. Robertson:
Nice Efficient Presentions for all Small Simple Groups and their Covers. LMS J. Comput. Math. 7: 266-283 (2004) - 2003
- [j13]George Havas, Edmund F. Robertson:
Irreducible Cyclic Presentations of the Trivial Group. Exp. Math. 12(4): 487-490 (2003) - [j12]George Havas, Colin Ramsay:
Breadth-First Search and the Andrews-Curtis Conjecture. Int. J. Algebra Comput. 13(1): 61-68 (2003) - [c23]George Havas:
On the Complexity of the Extended Euclidean Algorithm (extended abstract). CATS 2003: 1-4
1990 – 1999
- 1999
- [j11]Xin Gui Fang, George Havas, Jie Wang:
A Family of Non-quasiprimitive Graphs Admitting a Quasiprimitive 2-arc Transitive Group Action. Eur. J. Comb. 20(6): 551-557 (1999) - [j10]George Havas, Bohdan S. Majewski, Keith R. Matthews
:
Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction (addenda and errata). Exp. Math. 8(2): 205 (1999) - [c22]Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas:
GCD of Many Integers. COCOON 1999: 310-317 - [c21]Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor E. Shparlinski:
On Routing in Circulant Graphs. COCOON 1999: 360-369 - [c20]George Havas, Jean-Pierre Seifert:
The Complexity of the Extended GCD Problem. MFCS 1999: 103-113 - 1998
- [j9]George Havas, Bohdan S. Majewski, Keith R. Matthews:
Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction. Exp. Math. 7(2): 125-136 (1998) - [c19]Weifa Liang, George Havas:
Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3. CATS 1998: 37-50 - [c18]Weifa Liang, George Havas, Xiaojun Shen:
Improved Lightpath (Wavelength) Routing in Large WDM Networks. ICDCS 1998: 516-523 - [c17]George Havas, Clemens Wagner:
Some Performance Studies in Exact Linear Algebra. Wide Area Networks and High Performance Computing 1998: 161-170 - 1997
- [j8]George Havas:
Bohdan S. Majewski: Integer Matrix Diagonalization. J. Symb. Comput. 24(3/4): 399-408 (1997) - [j7]Zbigniew J. Czech, George Havas, Bohdan S. Majewski:
Perfect Hashing. Theor. Comput. Sci. 182(1-2): 1-143 (1997) - [c16]Gene Cooperman, George Havas:
Elementary algebra revisited: Randomized algorithms. Randomization Methods in Algorithm Design 1997: 37-44 - [c15]Weifa Liang, George Havas:
NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph. Euro-Par 1997: 430-439 - [c14]Xin Gui Fang, George Havas:
On the Worst-case Complexity of Integer Gaussian Elimination. ISSAC 1997: 28-31 - [c13]S. A. M. Makki, George Havas:
An Efficient Method for Constructing a Distributed Depth-First Search Tree. PDPTA 1997: 660-666 - 1996
- [j6]Bohdan S. Majewski, Nicholas C. Wormald, George Havas, Zbigniew J. Czech:
A Family of Perfect Hashing Methods. Comput. J. 39(6): 547-554 (1996) - [j5]S. A. M. Makki, George Havas:
Distributed Algorithms for Depth-First Search. Inf. Process. Lett. 60(1): 7-12 (1996) - [c12]David Ford, George Havas:
A New Algorithm and Refined Bounds for Extended Gcd Computation. ANTS 1996: 145-150 - 1995
- [c11]George Havas, Bohdan S. Majewski:
A Hard Problem That is Almost Always Easy. ISAAC 1995: 216-223 - [c10]Bohdan S. Majewski, George Havas:
A Solution to the Extended GCD Problem. ISSAC 1995: 248-253 - 1994
- [c9]Bohdan S. Majewski, George Havas:
The complexity of greatest common divisor computations. ANTS 1994: 184-193 - [c8]George Havas, Mike F. Newman, Eamonn A. O'Brien:
Groups of deficiency zero. Geometric and Computational Perspectives on Infinite Groups 1994: 53-67 - [c7]S. A. M. Makki, George Havas:
Distributed Algorithms for Constructing a Depth-First-Search Tree. ICPP (3) 1994: 270-273 - [c6]George Havas, Jin Xian Lian:
A New Problem in String Searching. ISAAC 1994: 660-668 - 1993
- [c5]George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech:
Graphs, Hypergraphs and Hashing. WG 1993: 153-165 - 1992
- [j4]John J. Cannon, George Havas:
Algorithms for Groups. Aust. Comput. J. 24(2): 51-60 (1992) - [j3]Zbigniew J. Czech, George Havas, Bohdan S. Majewski:
An Optimal Algorithm for Generating Minimal Perfect Hash Functions. Inf. Process. Lett. 43(5): 257-264 (1992) - [c4]George Havas, Edmund F. Robertson:
Application of Computational Tools for Finitely Presented Groups. Computational Support for Discrete Mathematics 1992: 29-39 - 1991
- [c3]George Havas:
Coset Enumeration Strategies. ISSAC 1991: 191-199 - 1990
- [j2]George Havas, Mike F. Newman, Michael R. Vaughan-Lee:
A Nilpotent Quotient Algorithm for Graded Lie Rings. J. Symb. Comput. 9(5/6): 653-664 (1990)
1980 – 1989
- 1981
- [j1]George Havas:
Hyperdisk, an access method for remote disk devices. Aust. Comput. J. 13(2): 64-65 (1981)
1970 – 1979
- 1979
- [c2]George Havas, Leon Sterling:
Integer matrices and Abelian groups (invited). EUROSAM 1979: 431-451 - 1976
- [c1]George Havas, Tim Nicholson:
Collection. SYMSACC 1976: 9-14
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
