Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
George Havas
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. Experimental Mathematics 16(3): 347-358 (2007)- 2005
- [j16]George Havas, Michael R. Vaughan-Lee: 4-Engel Groups are Locally Nilpotent. IJAC 15(4): 649-682 (2005)
- 2004
- [j15]Gilbert Baumslag, Sean Cleary, George Havas: Experimenting with Infinite Groups, I. Experimental Mathematics 13(4): 495-502 (2004)
- 2003
- [j14]George Havas, Edmund F. Robertson: Irreducible Cyclic Presentations of the Trivial Group. Experimental Mathematics 12(4): 487-490 (2003)
- [j13]George Havas: On the Complexity of the Extended Euclidean Algorithm (extended abstract). Electr. Notes Theor. Comput. Sci. 78: 1-4 (2003)
- [j12]George Havas, Colin Ramsay: Breadth-First Search and the Andrews-Curtis Conjecture. IJAC 13(1): 61-68 (2003)
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). Experimental Mathematics 8(2): 205 (1999)
- [c19]Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas: GCD of Many Integers. COCOON 1999: 310-317
- [c18]Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor Shparlinski: On Routing in Circulant Graphs. COCOON 1999: 360-369
- [c17]
- 1998
- [j9]George Havas, Bohdan S. Majewski, Keith R. Matthews: Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction. Experimental Mathematics 7(2): 125-136 (1998)
- [c16]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
- [c15]Weifa Liang, George Havas, Xiaojun Shen: Improved Lightpath (Wavelength) Routing in Large WDM Networks. ICDCS 1998: 516-523
- [c14]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)
- [c13]Weifa Liang, George Havas: NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph. Euro-Par 1997: 430-439
- [c12]Xin Gui Fang, George Havas: On the Worst-case Complexity of Integer Gaussian Elimination. ISSAC 1997: 28-31
- [c11]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)
- [c10]David Ford, George Havas: A New Algorithm and Refined Bounds for Extended Gcd Computation. ANTS 1996: 145-150
- 1995
- [c9]
- [c8]
- 1994
- [c7]Bohdan S. Majewski, George Havas: The complexity of greatest common divisor computations. ANTS 1994: 184-193
- [c6]S. A. M. Makki, George Havas: Distributed Algorithms for Constructing a Depth-First-Search Tree. ICPP (3) 1994: 270-273
- [c5]
- 1993
- [c4]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. Australian Computer Journal 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)
- 1991
- [c3]
- 1990
- [j2]George Havas, M. 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. Australian Computer Journal 13(2): 64-65 (1981)
1970 – 1979
- 1979
- [c2]
- 1976
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-22 20:45 CEST by the dblp team