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 Volume=45
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some new simple Lie algebras in characteristic 2
Bettina Eick
Journal Symbolic Computation
45
(9), 2010, pp. 943-951
Computing the support of monomial iterated mapping cones
Eduardo Sáenz-de-Cabezón
Journal Symbolic Computation
45
(10), 2010, pp. 953-964
On the De Boer-Pellikaan method for computing minimum distance
Ştefan O. Tohȃneanu
Journal Symbolic Computation
45
(10), 2010, pp. 965-974
Local Bézout Theorem
M. Emilia Alonso
,
Henri Lombardi
Journal Symbolic Computation
45
(10), 2010, pp. 975-985
Application of computational invariant theory to Kobayashi hyperbolicity and to Green-Griffiths algebraic degeneracy
Joël Merker
Journal Symbolic Computation
45
(10), 2010, pp. 986-1074
Effective bounds for
P
-recursive sequences
Marc Mezzarobba
,
Bruno Salvy
Journal Symbolic Computation
45
(10), 2010, pp. 1075-1096
Mechanical inference of invariants for FOR-loops
Stefan Kauer
,
Jürgen F.H. Winkler
Journal Symbolic Computation
45
(11), 2010, pp. 1101-1113
Reflexive transitive invariant relations: A basis for computing loop functions
Ali Mili
,
Shir Aharon
,
Chaitanya Nadkarni
,
Lamia Labed Jilani
,
Asma Louhichi
,
Olfa Mraihi
Journal Symbolic Computation
45
(11), 2010, pp. 1114-1143
An invariant-based approach to the verification of asynchronous parameterized networks
Igor V. Konnov
,
Vladimir A. Zakharov
Journal Symbolic Computation
45
(11), 2010, pp. 1144-1162
Verifying pointer safety for programs with unknown calls
Chenguang Luo
,
Florin Craciun
,
Shengchao Qin
,
Guanhua He
,
Wei-Ngan Chin
Journal Symbolic Computation
45
(11), 2010, pp. 1163-1183
Modular inference of subprogram contracts for safety checking
Yannick Moy
,
Claude Marché
Journal Symbolic Computation
45
(11), 2010, pp. 1184-1211
Constraint solving for interpolation
Andrey Rybalchenko
,
Viorica Sofronie-Stokkermans
Journal Symbolic Computation
45
(11), 2010, pp. 1212-1233
Termination of linear programs with nonlinear constraints
Bican Xia
,
Zhihai Zhang
Journal Symbolic Computation
45
(11), 2010, pp. 1234-1249
On non-defectivity of certain Segre-Veronese varieties
Hirotachi Abo
Journal Symbolic Computation
45
(12), 2010, pp. 1254-1269
Bounding the radii of balls meeting every connected component of semi-algebraic sets
Saugata Basu
,
Marie-Françoise Roy
Journal Symbolic Computation
45
(12), 2010, pp. 1270-1279
Modular Las Vegas algorithms for polynomial absolute factorization
Cristina Bertone
,
Guillaume Chèze
,
André Galligo
Journal Symbolic Computation
45
(12), 2010, pp. 1280-1295
An implicitization challenge for binary factor analysis
María Angélica Cueto
,
Enrique A. Tobis
,
Josephine Yu
Journal Symbolic Computation
45
(12), 2010, pp. 1296-1315
Dynamic Galois Theory
G.M. Diaz-Toca
,
H. Lombardi
Journal Symbolic Computation
45
(12), 2010, pp. 1316-1329
Extended F
_5
criteria
Amir Hashemi
,
Gwénolé Ars
Journal Symbolic Computation
45
(12), 2010, pp. 1330-1340
The first rational Chebyshev knots
P.-V. Koseleff
,
D. Pecker
,
F. Rouillier
Journal Symbolic Computation
45
(12), 2010, pp. 1341-1358
P
versus
NP
and geometry
J.M. Landsberg
Journal Symbolic Computation
45
(12), 2010, pp. 1359-1377
Curves and coherent Prüfer rings
Thierry Coquand
,
Henri Lombardi
,
Claude Quitté
Journal Symbolic Computation
45
(12), 2010, pp. 1378-1390
Gröbner bases for polynomial systems with parameters
Antonio Montes
,
Michael Wibmer
Journal Symbolic Computation
45
(12), 2010, pp. 1391-1425
Rational general solutions of first order non-autonomous parametrizable ODEs
L.X. Châu Ngô
,
Franz Winkler
Journal Symbolic Computation
45
(12), 2010, pp. 1426-1441
F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
Christian Eder
,
John Perry
Journal Symbolic Computation
45
(12), 2010, pp. 1442-1458
Seiten
<
1
2
3
4
>