Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Journal=J. Symbolic Computation AND YEAR=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Determination of socle series using the condensation method
Klaus Lux
,
Markus Wiegelmann
Journal Symbolic Computation
31
(1-2), 2001, pp. 163-178
Computing double cosets in soluble groups
Michael C. Slattery
Journal Symbolic Computation
31
(1-2), 2001, pp. 179-192
Computing in the Monster
Simon Norton
Journal Symbolic Computation
31
(1-2), 2001, pp. 193-201
A new existence proof for Ly, the sporadic simple group of R. Lyons
Holger W. Gollan
Journal Symbolic Computation
31
(1-2), 2001, pp. 203-209
Embeddings of
PSL(2,41)
and
PSL(2,49)
in
E_8(C)
Robert L., Jr. Griess
,
A.J.E. Ryba
Journal Symbolic Computation
31
(1-2), 2001, pp. 211-227
Calculating group cohomology: Tests for completion
Jon F. Carlson
Journal Symbolic Computation
31
(1-2), 2001, pp. 229-242
A new approach to primary decomposition
Alain Sausse
Journal Symbolic Computation
31
(1-2), 2001, pp. 243-257
An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups
Ulla Koppenhagen
,
Ernst W. Mayr
Journal Symbolic Computation
31
(1-2), 2001, pp. 259-276
Unification of concept terms in description logics
Franz Baader
,
Paliath Narendran
Journal Symbolic Computation
31
(3), 2001, pp. 277-305
Counting and Gröbner bases
K. Kalorkoti
Journal Symbolic Computation
31
(3), 2001, pp. 307-313
Sylvester-Habicht sequences and fast Cauchy index computation
Thomas Lickteig
,
Marie-Françoise Roy
Journal Symbolic Computation
31
(3), 2001, pp. 315-341
Implicitization of a general union of parametric varieties
F. Orecchia
Journal Symbolic Computation
31
(3), 2001, pp. 343-356
An implicitization algorithm for rational surfaces with no base points
Franck Aries
,
Rachid Senoussi
Journal Symbolic Computation
31
(4), 2001, pp. 357-365
Decomposition plans for geometric constraint systems - Part I: Performance measures for CAD
Christoph M. Hoffman
,
Andrew Lomonosov
,
Meera Sitharam
Journal Symbolic Computation
31
(4), 2001, pp. 367-408
Decomposition plans for geometric constraint problems - Part II: New algorithms
Christoph M. Hoffman
,
Andrew Lomonosov
,
Meera Sitharam
Journal Symbolic Computation
31
(4), 2001, pp. 409-427
Matrix generators for exceptional groups of Lie type
R.B. Howlett
,
L.J. Rylands
,
D.E. Taylor
Journal Symbolic Computation
31
(4), 2001, pp. 429-445
A generalized Sylvester identity and fraction-free random Gaussian elimination
Thom Mulders
Journal Symbolic Computation
31
(4), 2001, pp. 447-460
Parallelization of perturbation analysis: Application to large-scale engineering problems
Raya Khanin
,
Matthew Cartmell
Journal Symbolic Computation
31
(4), 2001, pp. 461-473
A parser for the interval evaluation of analytical functions and its application to engineering problems
J.-P. Merlet
Journal Symbolic Computation
31
(4), 2001, pp. 475-486
A higher-order interpretation of deductive tableau
Abdelwaheb Ayari
,
David Basin
Journal Symbolic Computation
31
(5), 2001, pp. 487-520
Simple CAD constructions and its applications
Christopher W. Brown
Journal Symbolic Computation
31
(5), 2001, pp. 521-547
Septic number fields which are ramified only at one small prime
Sharon Brueggeman
Journal Symbolic Computation
31
(5), 2001, pp. 549-555
Syntactical methods for braids of three strands
Serge Burckel
Journal Symbolic Computation
31
(5), 2001, pp. 557-564
Gröbner bases over Galois rings with an application to decoding alternant codes
Eimear Byrne
,
Patrick Fitzpatrick
Journal Symbolic Computation
31
(5), 2001, pp. 565-584
Resultants and moving surfaces
Carlos D'Andrea
Journal Symbolic Computation
31
(5), 2001, pp. 585-602
Seiten
<
1
2
3
4
>