See this document in CiteSeerX!

Centre For Discrete Mathematics And Computing  (Make Corrections)  
in the Department Of Mathematics and the Department Of Computer Science And...



  Home/Search   Context   Related

 
View or download:
cs.uq.oz.au/personal/ha...rep0005.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.uq.oz.au/personal/havas...cdmc (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: algebraic algorithms. Perfect hashing. Fundamental algorithms for parallel and distributed systems. Finite fields and their applications. Computational combinatorics. Algorithm development for linear algebra. 5. Reports on Conferences The Twenty-third Australasian Conference on Combinatorial Mathematics and Combinatorial Computing, Queensland, 6--10 July 1998 The 23ACCMCC was held in Brisbane from 6 to 10 July 1998. On the Monday, Thursday and Friday, talks were held at The University of... (Update)

Active bibliography (related documents):   More   All
0.3:   Experiments in Coset Enumeration - Havas, Ramsay (2001)   (Correct)
0.3:   Generating All the Minimal Separators of a Graph - Berry, Bordat, Cogis (1999)   (Correct)
0.3:   Obtaining and Maintaining Polynomial-Sized Concept Lattices - Berry, Sigayret (2002)   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:   More   All
0.8:   Critical Sets in Latin Squares and Associated Structures - Bean (2001)   (Correct)
0.6:   Steiner Trades That Give Rise to Completely.. - Bean, Donovan.. (2000)   (Correct)
0.5:   Further Decompositions of Complete Tripartite Graphs Into 5-Cycles - Cavenagh   (Correct)

BibTeX entry:   (Update)

@misc{ department-centre,
  author = "In The Department",
  title = "Centre For Discrete Mathematics And Computing",
  url = "citeseer.ist.psu.edu/334700.html" }
Citations (may not include all citations):
21   IEEE Computer Society (context) - Conference, Computing et al.
5   A complete formal development using Cogito - HAMILTON, Hazel et al.
3   Efficient enumeration of all minimal separators in a graph (context) - Shen, LIANG
3   Some challenging group presentations - George, Derek et al.
2   Anne Penfold STREET and N H WILLIAMS (context) - Anne, WILLIAMS et al.
2   Anne Penfold STREET and N H WILLIAMS (context) - Anne, WILLIAMS et al.
1   Hyperovals and unitals in Figueroa planes (context) - HAMILTON, de Resmini - 1997
1   A class of functions and their application in constructing s.. (context) - Robert, Marie
1   Bent polynomials over finite fields (context) - COULTER, Matthews
1   Engel quasigroups associated with cycle systems (context) - Sarah
1   The possible number of cycles in cycle systems (context) - Elizabeth, BILLINGTON et al.
1   Packing and covering the complete graph with cubes (context) - ADAMS, BRYANT et al. - 1999
1   Decomposing complete tripartite graphs into cycles of length.. (context) - Mathematica, Elizabeth et al.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC