UB Paderborn / Katalog / Suche / in CDI

Municipal solid waste composition determination supporting the integrated solid waste management system in the island of Crete

Waste management (Elmsford), 2006-01, Vol.26 (6), p.668-679

2006

Volltextzugriff (PDF)

Burnside Groups: Proceedings of a Workshop Held at the University of Bielefeld, Germany, June-July 1977

1980 edition., 2006

Volltextzugriff (PDF)

Certain Roman and flock generalized quadrangles have nonisomorphic elation groups

Advances in geometry, 2006-07, Vol.6 (3), p.389-395

2006

Volltextzugriff (PDF)

All simple groups with order from 1 million to 5 million are efficient

International journal of group theory, 2014-03, Vol.3 (1), p.17-30

2014

Volltextzugriff (PDF)

Improved lightpath (wavelength) routing in large WDM networks

Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183), 1998, p.516-523

1998

Volltextzugriff (PDF)

Do we tolerate inconsistencies?

Dialectica, 1993-01, Vol.47 (1), p.27-35

Havas, Katalin G.

1993

Volltextzugriff (PDF)

Perfect hashing

Theoretical computer science, 1997-01, Vol.182 (1), p.1-143

1997

Volltextzugriff (PDF)

PUBLIC SAVINGS AND PRODUCTION FINANCE

Acta oeconomica, 1982-01, Vol.28 (1/2), p.109-131

HAVAS, G.

1982

Volltextzugriff (PDF)

Experimenting with Infinite Groups, I

Experimental mathematics, 2004-01, Vol.13 (4), p.495-502

2004

Volltextzugriff (PDF)

On the Efficiency of Some Finite Groups

Communications in algebra, 2004-03, Vol.32 (2), p.649-656

2004

Volltextzugriff (PDF)

Irreducible Cyclic Presentations of the Trivial Group

Experimental mathematics, 2003-01, Vol.12 (4), p.487-490

2003

Volltextzugriff (PDF)

Finite Geometries, Groups, and Computation: Proceedings of the Conference 'Finite Geometries, Groups, and Computation', Pingree Park, Colorado, USA, September 4-9, 2004

1, 2008

Volltextzugriff (PDF)

Proving a group trivial made easy: A case study in coset enumeration

Bulletin of the Australian Mathematical Society, 2000-08, Vol.62 (1), p.105-118

2000

Volltextzugriff (PDF)

CHILDREN, PHILOSOPHY, AND LOGIC FROM A DIALECTICAL POINT OF VIEW

Logique et analyse, 1995-06, Vol.38 (150/152), p.151-158

HAVAS, Katalin G.

1995

Volltextzugriff (PDF)

On the Automorphism Groups of Quasiprimitive Almost Simple Graphs

Journal of algebra, 1999-12, Vol.222 (1), p.271-283

1999

Volltextzugriff (PDF)

Integer Matrix Diagonalization

Journal of symbolic computation, 1997-09, Vol.24 (3-4), p.399-408

1997

Volltextzugriff (PDF)

The Atlas of Finite Groups - Ten Years On

1, 1998

Volltextzugriff (PDF)

An optimal algorithm for generating minimal perfect hash functions

Information processing letters, 1992-10, Vol.43 (5), p.257-264

1992

Volltextzugriff (PDF)

Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction

Experimental mathematics, 1998-01, Vol.7 (2), p.125-136

1998

Volltextzugriff (PDF)

Efficient Simple Groups

Communications in algebra, 2003-01, Vol.31 (10), p.5191-5197

2003

Volltextzugriff (PDF)

Some Remarks on an Attempt at Formalizing Dialectical Logic

Studies in Soviet Thought, 1981-11, Vol.22 (4), p.257-264

Havas, Katalin G.

1981

Volltextzugriff (PDF)

Distributed algorithms for depth-first search

Information processing letters, 1996-10, Vol.60 (1), p.7-12

1996

Volltextzugriff (PDF)

NC approximation algorithms for 2-connectivity augmentation in a graph

Euro-Par'97 Parallel Processing, 2005, p.430-439

2005

Volltextzugriff (PDF)

Power consumption of screw agitators in Newtonian liquids of high viscosity

Chemical engineering science, 1979, Vol.34 (9), p.1160-1162

1979

Volltextzugriff (PDF)

EFFICIENT SIMPLE GROUPS

Communications in algebra, 2002-02, Vol.30 (2), p.971-975

2002

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Municipal solid waste composition determination supporting the integrated solid waste management system in the island of Crete

Burnside Groups: Proceedings of a Workshop Held at the University of Bielefeld, Germany, June-July 1977

Certain Roman and flock generalized quadrangles have nonisomorphic elation groups

All simple groups with order from 1 million to 5 million are efficient

Improved lightpath (wavelength) routing in large WDM networks

Do we tolerate inconsistencies?

Perfect hashing

PUBLIC SAVINGS AND PRODUCTION FINANCE

Experimenting with Infinite Groups, I

On the Efficiency of Some Finite Groups

Irreducible Cyclic Presentations of the Trivial Group

Finite Geometries, Groups, and Computation: Proceedings of the Conference 'Finite Geometries, Groups, and Computation', Pingree Park, Colorado, USA, September 4-9, 2004

Proving a group trivial made easy: A case study in coset enumeration

CHILDREN, PHILOSOPHY, AND LOGIC FROM A DIALECTICAL POINT OF VIEW

On the Automorphism Groups of Quasiprimitive Almost Simple Graphs

Integer Matrix Diagonalization

The Atlas of Finite Groups - Ten Years On

An optimal algorithm for generating minimal perfect hash functions

Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction

Efficient Simple Groups

Some Remarks on an Attempt at Formalizing Dialectical Logic

Distributed algorithms for depth-first search

NC approximation algorithms for 2-connectivity augmentation in a graph

Power consumption of screw agitators in Newtonian liquids of high viscosity

EFFICIENT SIMPLE GROUPS

Suchergebnisse filtern