| Publication | Date of Publication | Type |
|---|
On the spanning trees of weighted graphs
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
On polynomial ideals, their complexity, and applications
Fundamentals of Computation Theory | 2022-12-09 | Paper |
The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Vladimir Gerdt dies at 73
ACM Communications in Computer Algebra | 2022-09-06 | Paper |
Memories on Vladimir Gerdt
Journal of Symbolic Computation | 2021-09-29 | Paper |
Inequalities for the number of walks in graphs
2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Complexity of membership problems of different types of polynomial ideals
Algorithmic and Experimental Methods in Algebra, Geometry, and Number Theory | 2018-11-16 | Paper |
Embedding graphs with bounded treewidth into optimal hypercubes
STACS 96 | 2017-11-16 | Paper |
Completeness results for generalized communication-free Petri nets with arbitrary arc multiplicities
Fundamenta Informaticae | 2017-03-16 | Paper |
Complexity results for problems of communication-free Petri nets and related formalisms
Fundamenta Informaticae | 2016-05-11 | Paper |
Degree bounds for Gröbner bases of low-dimensional polynomial ideals
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation | 2015-09-17 | Paper |
Space-efficient Gröbner basis computation without degree bounds
Proceedings of the 36th international symposium on Symbolic and algebraic computation | 2015-06-09 | Paper |
A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application
Application and Theory of Petri Nets and Concurrency | 2014-07-08 | Paper |
Completeness results for generalized communication-free Petri nets with arbitrary edge multiplicities
Lecture Notes in Computer Science | 2014-07-07 | Paper |
Inequalities for the number of walks in graphs
Algorithmica | 2013-11-11 | Paper |
Results on equivalence, boundedness, liveness, and covering problems of BPP-Petri nets
Application and Theory of Petri Nets and Concurrency | 2013-06-28 | Paper |
Dimension-dependent bounds for Gröbner bases of polynomial ideals
Journal of Symbolic Computation | 2013-01-10 | Paper |
On the Provably Tight Approximation of Optimal Meshing for Non-convex Regions
Computer Algebra in Scientific Computing | 2008-07-04 | Paper |
Stability Investigation of a Difference Scheme for Incompressible Navier-Stokes Equations
Computer Algebra in Scientific Computing | 2008-07-01 | Paper |
Automated Deduction in Geometry
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Computer Algebra in Scientific Computing
Lecture Notes in Computer Science | 2006-07-07 | Paper |
SCHEDULING INTERVAL ORDERS IN PARALLEL
Parallel Algorithms and Applications | 2004-10-06 | Paper |
| scientific article; zbMATH DE number 2102751 (Why is no real title available?) | 2004-09-24 | Paper |
Efficient Embeddings into Hypercube-like Topologies
The Computer Journal | 2004-09-06 | Paper |
| scientific article; zbMATH DE number 2090609 (Why is no real title available?) | 2004-08-12 | Paper |
Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1759464 (Why is no real title available?) | 2002-11-25 | Paper |
Efficient Dynamic Embeddings of Binary Trees into Hypercubes
Journal of Algorithms | 2002-09-30 | Paper |
Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
Journal of Algorithms | 2002-09-30 | Paper |
Optimal dynamic embeddings of complete binary trees into hypercubes
Journal of Parallel and Distributed Computing | 2002-07-22 | Paper |
| scientific article; zbMATH DE number 1760000 (Why is no real title available?) | 2002-06-25 | Paper |
An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups
Journal of Symbolic Computation | 2002-04-26 | Paper |
On-line scheduling of parallel jobs with runtime restrictions
Theoretical Computer Science | 2002-03-03 | Paper |
An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals
Journal of Symbolic Computation | 2000-05-08 | Paper |
| scientific article; zbMATH DE number 1254276 (Why is no real title available?) | 2000-01-09 | Paper |
| scientific article; zbMATH DE number 1254275 (Why is no real title available?) | 1999-10-14 | Paper |
Some complexity results for polynomial ideals
Journal of Complexity | 1999-08-02 | Paper |
| scientific article; zbMATH DE number 1127076 (Why is no real title available?) | 1998-06-04 | Paper |
Divide-and-conquer algorithms on the hypercube
Theoretical Computer Science | 1997-09-10 | Paper |
Counting Minimum Weight Spanning Trees
Journal of Algorithms | 1997-08-25 | Paper |
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
Journal of Algorithms | 1996-05-06 | Paper |
Optimal routing of parentheses on the hypercube
Journal of Parallel and Distributed Computing | 1995-07-20 | Paper |
| scientific article; zbMATH DE number 512824 (Why is no real title available?) | 1994-11-13 | Paper |
Pipelined parallel prefix computations, and sorting on a pipelined hypercube
Journal of Parallel and Distributed Computing | 1993-06-29 | Paper |
On the spanning trees of weighted graphs
Combinatorica | 1993-03-10 | Paper |
The complexity of circuit value and network stability
Journal of Computer and System Sciences | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 4147494 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4147533 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4135722 (Why is no real title available?) | 1990-01-01 | Paper |
Parallel approximation algorithms for bin packing
Information and Computation | 1989-01-01 | Paper |
Projections of vector addition system reachability sets are semilinear
Theoretical Computer Science | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4064461 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4049080 (Why is no real title available?) | 1987-01-01 | Paper |
Parallelism and the maximal path problem
Information Processing Letters | 1987-01-01 | Paper |
Two Processor Scheduling is in $\mathcal{NC}$
SIAM Journal on Computing | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3963191 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3902700 (Why is no real title available?) | 1984-01-01 | Paper |
An Algorithm for the General Petri Net Reachability Problem
SIAM Journal on Computing | 1984-01-01 | Paper |
The complexity of the word problems for commutative semigroups and polynomial ideals
Advances in Mathematics | 1982-01-01 | Paper |
The Complexity of the Finite Containment Problem for Petri Nets
Journal of the ACM | 1981-01-01 | Paper |
Persistence of vector replacement systems is decidable
Acta Informatica | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3748430 (Why is no real title available?) | 1980-01-01 | Paper |
