Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Symbolic Computation, Volume 80
Volumes 80, Part 1, May - June 2017
- Tudor Jebelean, Wei Li, Dongming Wang:
Special Issue on Program Verification, Automated Debugging and Symbolic Computation. 1-3 - Tigran Avanesov, Yannick Chevalier
, Michaël Rusinowitch, Mathieu Turuani:
Intruder deducibility constraints with negation. Decidability and application to secured service compositions. 4-26 - Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch, Mathieu Turuani:
Satisfiability of general intruder constraints with and without a set constructor. 27-61 - Liyun Dai, Ting Gan, Bican Xia, Naijun Zhan:
Barrier certificates revisited. 62-86 - Dongchen Jiang, Wei Li:
Revision with probability. 87-100 - Jens Knoop, Laura Kovács, Jakob Zwirchmayr:
Replacing conjectures by positive knowledge: Inferring proven precise worst-case execution time bounds using symbolic execution. 101-124 - Dorel Lucanu, Vlad Rusu, Andrei Arusoaie:
A generic framework for symbolic execution: A coinductive approach. 125-163 - Vincent Rahli, Joe B. Wells, John Pirie, Fairouz Kamareddine:
Skalpel: A constraint-based type error slicer for Standard ML. 164-208 - Sorin Stratulat:
Mechanically certifying formula-based Noetherian induction reasoning. 209-249
Volumes 80, Part 2, May - June 2017
- Arthur Renaudineau:
A tropical construction of a family of real reducible curves. 251-272 - Mohammad Masjed-Jamei, Wolfram Koepf:
Symbolic computation of some power-trigonometric series. 273-284 - Rémi Imbach, Guillaume Moroz, Marc Pouget:
A certified numerical algorithm for the topology of resultant and discriminant curves. 285-306 - Maria-Laura Torrente, Mauro Carlo Beltrametti, Andrew J. Sommese:
Perturbation results on the zero-locus of a polynomial. 307-328 - Tristan Vaccon:
Matrix-F5 algorithms over finite-precision complete discrete valuation fields. 329-350 - Alin Bostan, Pierre Lairez, Bruno Salvy:
Multiple binomial sums. 351-386 - Hernán de Alba, Marcel Morales:
Betti numbers of binomial ideals. 387-402 - Roberto La Scala:
Monomial right ideals and the Hilbert series of noncommutative modules. 403-415 - Martin Scheicher:
Gröbner bases and their application to the Cauchy problem on finitely generated affine monoids. 416-450 - Daniel J. Hernández, Pedro Teixeira:
F-threshold functions: Syzygy gap fractals and the two-variable homogeneous case. 451-483 - Murat Cenk, M. Anwar Hasan:
On the arithmetic complexity of Strassen-like matrix multiplications. 484-501 - Hwangrae Lee:
The Euclidean distance degree of Fermat hypersurfaces. 502-510 - Joshua Maglione:
Efficient characteristic refinements for finite groups. 511-520
Volumes 80, Part 3, May - June 2017
- José Martín Méndez González:
Revealing regions of multiple steady states in heterogeneous catalytic chemical reaction networks using Gröbner basis. 521-537 - Jean-Charles Faugère, Chenqi Mou:
Sparse FGLM algorithms. 538-569 - Gerhard Pfister, Dorin Popescu:
Constructive General Neron Desingularization for one dimensional local rings. 570-580 - Jean-François Biasse, Claus Fieker, Tommy Hofmann:
On the computation of the HNF of a module over the ring of integers of a number field. 581-615 - Carsten Schneider:
Summation Theory II: Characterizations of RΠΣ⁎-extensions and algorithmic aspects. 616-664 - Xiao-Shan Gao, Zhang Huang, Chun-Ming Yuan:
Binomial difference ideals. 665-706 - John Abbott:
Fault-tolerant modular reconstruction of rational numbers. 707-718 - Christian Eder, Jean-Charles Faugère:
A survey on signature-based algorithms for computing Gröbner bases. 719-784 - Jingjun Han, Liyun Dai, Hoon Hong, Bican Xia:
Open weak CAD and its applications. 785-816 - Alice C. Niemeyer, Götz Pfeiffer, Cheryl E. Praeger:
On the complexity of multiplication in the Iwahori-Hecke algebra of the symmetric group. 817-832 - Man Wai Cheung, Christian Ikenmeyer, Sevak Mkrtchyan:
Symmetrizing tableaux and the 5th case of the Foulkes conjecture. 833-843 - Hoon Hong, Zachary Hough, Irina A. Kogan:
Algorithm for computing μ-bases of univariate polynomials. 844-874
a service of 
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-04-19 20:20 CEST 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:
