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=1993
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On Holt's algorithm
Greg Butler
,
John J. Cannon
Journal Symbolic Computation
15
(2), 1993, pp. 229-233
Finite acyclic theories are unitary
Satish R. Thatte
Journal Symbolic Computation
15
(2), 1993, pp. 235-249
Standard bases in power series rings: Uniqueness and superfluous critical pairs
Thomas Becker
Journal Symbolic Computation
15
(3), 1993, pp. 251-265
Primary decomposition of mudules: Two variables over a field
Elizabeth W. Rutman
Journal Symbolic Computation
15
(3), 1993, pp. 267-275
A combinatorial proof of the effective Nullstellensatz
Thomas W. Dubé
Journal Symbolic Computation
15
(3), 1993, pp. 277-296
On the representation of 1 by binary cubic forms of positive discriminant
Frank Lippok
Journal Symbolic Computation
15
(3), 1993, pp. 297-313
Identities arising from Hecke transformations of modular forms over
Q(\surd2)
and
Q(\surd3)
Jesse Ira Deutsch
Journal Symbolic Computation
15
(3), 1993, pp. 315-323
The Brauer tree for
J_3
in characteristic 17
Robert A. Wilson
Journal Symbolic Computation
15
(3), 1993, pp. 325-330
Completeness of combinations of constructor systems
Aart Middeldorp
,
Yoshihito Toyama
Journal Symbolic Computation
15
(3), 1993, pp. 331-348
Automatic computation of
Z
- & inverse
Z
-transformations by Maple
Rongdong Wang
,
Peng-Yung Woo
Journal Symbolic Computation
15
(3), 1993, pp. 349-363
Surprising mathematics using a computer algebra system
François Bergeron
Journal Symbolic Computation
15
(3), 1993, pp. 365-370
Factorization of multivariate polynomials with coefficients in
F_p
Guy Viry
Journal Symbolic Computation
15
(4), 1993, pp. 371-391
Polynomial factorization: Sharp bounds, efficient algorithms
Bernard Beauzamy
,
Vilmar Trevisan
,
Paul S. Wang
Journal Symbolic Computation
15
(4), 1993, pp. 393-413
A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
Wayne Snyder
Journal Symbolic Computation
15
(4), 1993, pp. 415-450
An efficient algorithm and parallel implementations for binary and residue number systems
C.N. Zhang
,
B. Shirazi
,
D.Y.Y. Yun
Journal Symbolic Computation
15
(4), 1993, pp. 451-462
Deductive and inductive synthesis of equational programs
Nachum Dershowitz
,
Uday S. Reddy
Journal Symbolic Computation
15
(5-6), 1993, pp. 467-494
Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation
Dmitri Boulanger
,
Maurice Bruynooghe
Journal Symbolic Computation
15
(5-6), 1993, pp. 495-521
Origin tracking
A. van Deursen
,
P. Klint
,
F. Tip
Journal Symbolic Computation
15
(5-6), 1993, pp. 523-545
Synthesis aspects in the design of efficient processor arrays from affine recurrence equations
Philippe Clauss
,
Catherine Mongenet
Journal Symbolic Computation
15
(5-6), 1993, pp. 547-569
Constructing specification morphisms
Douglas R. Smith
Journal Symbolic Computation
15
(5-6), 1993, pp. 571-606
Synthesis of ML programs in the system Coq
Christine Paulin-Mohring
,
Benjamin Werner
Journal Symbolic Computation
15
(5-6), 1993, pp. 607-640
QPC
_2
: A constructive calculus with parameterized specifications
Yukihide Takayama
Journal Symbolic Computation
15
(5-6), 1993, pp. 641-672
A derived algorithm for evaluating
\varepsilon
-expressions over abstract sets
Eugenio G. Omodeo
,
Franco Parlamento
,
Alberto Policriti
Journal Symbolic Computation
15
(5-6), 1993, pp. 673-704
On the mechanical derivation of loop invariants
Ritu Chadha
,
David A. Plaisted
Journal Symbolic Computation
15
(5-6), 1993, pp. 705-744
Logical debugging
Nachum Dershowitz
,
Yuh-Jeng Lee
Journal Symbolic Computation
15
(5-6), 1993, pp. 745-773
Seiten
<
1
2
3
4
>