default search action
Journal of Symbolic Computation, Volume 46, 2011
Volume 46, Number 1, January 2011
- Jon Wilkening, Jia Yu:
A local construction of the Smith normal form of a matrix polynomial. 1-22 - Sandra Di Rocco, David Eklund
, Chris Peterson, Andrew J. Sommese:
Chern numbers of smooth varieties via homotopy continuation and intersection theory. 23-33 - Alessandra Bernardi
Computing symmetric rank for symmetric tensors. 34-53 - Paraskevas Alvanos, Dimitrios Poulakis:
Solving genus zero Diophantine equations over number fields. 54-69 - Kurt Mehlhorn, Michael Sagraloff:
A deterministic algorithm for isolating real roots of a real polynomial. 70-90 - Sonia L. Rueda
Corrigendum to "Linear complete differential resultants and the implicitization of linear DPPEs" [J. Symbolic Comput. 45(3) March (2010) 324-341]. 91-92
Volume 46, Number 2, February 2011
- Demis Ballis, Temur Kutsia:
Foreword. 93-94 - Gregory Malecha
Trace-based verification of imperative programs with I/O. 95-118 - Federico Banti, Rosario Pugliese
An accessible verification environment for UML models of services. 119-149 - Zef Hemel, Danny M. Groenewegen
Static consistency checking of web applications with WebDSL. 150-182 - Christian Schönberg, Franz Weitl, Burkhard Freitag:
Verifying the consistency of web-based technical documentations. 183-206 - Marino Linaje Trigueros
Providing RIA user interfaces with accessibility properties. 207-217
Volume 46, Number 3, March 2011
- Jochen Pfalzgraf, Hartmut Ehrig, Ulrike Golas
Foreword. 219-221 - Paolo Baldan, Filippo Bonchi
A lattice-theoretical perspective on adhesive categories. 222-245 - Benjamin Braatz
How to delete categorically - Two pushout complement constructions. 246-271 - Jean-Guillaume Dumas
Cartesian effect categories are Freyd-categories. 272-293 - Fernando Orejas
Symbolic graphs for attributed graph constraints. 294-315 - Christoph Schulz, Michael Löwe, Harald König:
A categorical framework for the transformation of object-oriented systems: Models and data. 316-337
Volume 46, Number 4, April 2011
- Joris van der Hoeven:
Meta-expansion of transseries. 339-359 - Graham Ellis, Paul Smith:
Computing group cohomology rings from the Lyndon-Hochschild-Serre spectral sequence. 360-370 - Scott H. Murray
Constructive homomorphisms for classical groups. 371-384 - Marie-Françoise Roy, Aviva Szpirglas:
Sylvester double sums and subresultants. 385-395 - Annick Valibouze:
Gröbner basis of the alternating galoisian ideal. 396-405 - Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1): Algorithms and complexity. 406-437 - Willem A. de Graaf:
Computing representatives of nilpotent orbits of θ-groups. 438-458 - Jean-Charles Faugère, Ye Liang:
Artificial discontinuities of single-parametric Gröbner bases. 459-466 - Michael Hemmer, Laurent Dupont, Sylvain Petitjean, Elmar Schömer
A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics. 467-494
Volume 46, Number 5, May 2011
- Elizabeth Arnold, Ilias S. Kotsireas, Markus Rosenkranz:
Bruno Buchberger and the world of Gröbner bases. 495-497 - Anna Maria Bigatti
Computing inhomogeneous Gröbner bases. 498-510 - Víctor Blanco
Some algebraic methods for solving multiobjective polynomial integer programs. 511-533 - Massimo Caboara, Fabrizio Caruso, Carlo Traverso:
Lattice Polly Cracker cryptosystems. 534-549 - Anne Frühbis-Krüger
A modified coefficient ideal for use with the strict transform. 550-560 - Gert-Martin Greuel, Frank Seelisch, Oliver Wienand:
The Gröbner basis of the ideal of vanishing polynomials. 561-570 - Tetsuo Ida, Asem Kasem, Fadoua Ghourabi, Hidekazu Takahashi:
Morley's theorem revisited: Origami construction and automated proof. 571-583 - K. Kalorkoti:
Model checking in the modal μ-calculus and generic solutions. 584-594 - Viktor Levandovskyy, Kristina Schindelar:
Computing diagonal form and Jacobson normal form of a matrix using Gröbner bases. 595-608 - Agustín Marcelo, Peter Schenzel:
Non-Cohen-Macaulay unique factorization domains in small dimensions. 609-621 - Yosuke Sato, Shutaro Inoue, Akira Suzuki, Katsusuke Nabeshima, Kô Sakai:
Boolean Gröbner bases. 622-632
Volume 46, Number 6, June 2011
- Moulay A. Barkatou, Thomas Cluzeau, Carole El Bacha:
Simple forms of higher-order linear differential systems and their applications in computing regular solutions. 633-658 - Nicoleta Bila:
On a new method for finding generalized equivalence transformations for differential equations involving arbitrary functions. 659-671 - Nazeran Idrees, Gerhard Pfister, Stefan Steidel:
Parallelization of Modular Algorithms. 672-684 - Jónathan Heras
fKenzo: A user interface for computations in Algebraic Topology. 685-698 - Khodabakhsh Hessami Pilehrood, Tatiana Hessami Pilehrood
A q-analogue of the Bailey-Borwein-Bradley identity. 699-711 - Daniel Plaumann
Quartic curves and their bitangents. 712-733
Volume 46, Number 7, July 2011
- Mark Giesbrecht, Stephen M. Watt:
In honour of Keith Geddes on his 60th birthday. 735-740 - David H. Bailey, Jonathan M. Borwein
High-precision numerical integration: Progress and challenges. 741-754 - Danko Adrovic, Jan Verschelde:
Tropical algebraic geometry in Maple: A preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients. 755-772 - Gilles Villard:
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation. 773-790 - Daniel S. Roche
Chunky and equal-spaced polynomial multiplication. 791-806 - Michael B. Monagan, Roman Pearce:
Sparse polynomial division using a heap. 807-822 - Jean-Guillaume Dumas
Simultaneous modular reduction and Kronecker substitution for small finite fields. 823-840 - Xin Li, Marc Moreno Maza, Raqeeb Rasheed, Éric Schost:
The modpn library: Bringing fast polynomial arithmetic into Maple. 841-858 - David R. Stoutemyer:
Ten commandments for good default expression simplification. 859-887
Volume 46, Number 8, August 2011
- Waldemar Hebisch, Martin Rubey:
Extended rate, more GFUN. 889-903 - Ting Zhao, Dongming Wang, Hoon Hong:
Solution formulas for cubic equations without or with constraints. 904-918 - Ioannis Z. Emiris
Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants. 919-942 - Wouter Castryck
Toric forms of elliptic curves and their arithmetic. 943-966 - Luis Felipe Tabera
Optimal affine reparametrization of rational curves. 967-976
Volume 46, Number 9, September 2011
- Sonia L. Rueda
A perturbed differential resultant based implicitization algorithm for linear DPPEs. 977-996 - Mahjoub Langar, Mohamed Mejri, Kamel Adi:
Formal enforcement of security policies on concurrent systems. 997-1016 - Alberto Arri, John Perry:
The F5 criterion revised. 1017-1029 - J. Rafael Sendra
Radical parametrizations of algebraic curves by adjoint curves. 1030-1038 - Mari F. Castle, Victoria Powers, Bruce Reznick:
Pólya's Theorem with zeros. 1039-1048 - Jean-François Pommaret:
Macaulay inverse systems revisited. 1049-1069 - Francesca Cioffi
Flat families by strongly stable ideals and a generalization of Gröbner bases. 1070-1084
- Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Obituary. Philippe Flajolet. 1085-1086
Volume 46, Number 10, October 2011
- Stefano Maggiolo, Nicola Pagani:
Generating stable modular graphs. 1087-1097 - Sebastian Jambor:
Computing minimal associated primes in polynomial rings over the integers. 1098-1104 - Jesse Beder, Jason McCullough
Ideals with larger projective dimension and regularity. 1105-1113 - Lisi D'Alfonso, Gabriela Jeronimo, François Ollivier
A geometric index reduction method for implicit systems of differential algebraic equations. 1114-1138 - Guillaume Moroz:
Properness defects of projection and minimal discriminant variety. 1139-1157 - Taro Kawazoe, Masayuki Noro:
Algorithms for computing a primary ideal decomposition without producing intermediate redundant components. 1158-1172 - Lam Xuan Châu Ngô, Franz Winkler:
Rational general solutions of planar rational systems of autonomous ODEs. 1173-1186
- Mahdi Dehghani Darmian, Amir Hashemi, Antonio Montes:
Erratum to "A new algorithm for discussing Gröbner bases with parameters" [J. Symbolic Comput. 33(1-2) (2002) 183-208]. 1187-1188
Volume 46, Number 11, November 2011
- Viktor Levandovskyy, Eva Zerz, Kristina Schindelar:
Exact linear modeling using Ore algebras. 1189-1204 - Sergei A. Abramov
Subanalytic solutions of linear difference equations and multidimensional hypergeometric sequences. 1205-1228 - Rocío Blanco
Embedded desingularization of toric varieties. 1229-1241 - Mark Giesbrecht, Daniel S. Roche
Detecting lacunary perfect powers and computing their roots. 1242-1259 - Jesús A. De Loera, Jon Lee
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz. 1260-1283 - Adam W. Strzebonski
Cylindrical decomposition for systems transcendental in the first variable. 1284-1290
Volume 46, Number 12, December 2011
- François Lemaire
When does <T> equal sat(T)? 1291-1305 - Kosaku Nagasaka:
Approximate polynomial GCD over integers. 1306-1317 - Hiroshi Sekigawa
Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions. 1318-1335 - Martin Raum
How to implement a modular form. 1336-1354 - Douglas Poole, Willy Hereman
Symbolic computation of conservation laws for nonlinear partial differential equations in multiple space dimensions. 1355-1377 - Alin Bostan, Muhammad F. I. Chowdhury, Joris van der Hoeven
Homotopy techniques for multiplication modulo triangular sets. 1378-1402 - Alain Bretto
Cayley graphs and G-graphs: Some applications. 1403-1412
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-26 00:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: