Dmitry N. Kozlov

According to our database, Dmitry N. Kozlov authored at least 29 papers between 1996 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Stirling complexes.

Dmitry N. Kozlov

J. Appl. Comput. Topol., March, 2023

2020

A combinatorial method to compute explicit homology cycles using Discrete Morse Theory.

Dmitry N. Kozlov

J. Appl. Comput. Topol., 2020

2017

Structure theory of flip graphs with applications to Weak Symmetry Breaking.

Dmitry N. Kozlov

J. Appl. Comput. Topol., 2017

The First Cheeger Constant of a Simplex.

Dmitry N. Kozlov

Graphs Comb., 2017

All binomial identities are orderable.

Dmitry N. Kozlov

Eur. J. Comb., 2017

Witness structures and immediate snapshot complexes.

Dmitry N. Kozlov

Discret. Math. Theor. Comput. Sci., 2017

2016

Topological Methods in Distributed Computing (Dagstuhl Seminar 16282).

Dmitry Feichtner-Kozlov, Damien Imbs

Dagstuhl Reports, 2016

2015

Weak symmetry breaking and abstract simplex paths.

Dmitry N. Kozlov

Math. Struct. Comput. Sci., 2015

Combinatorial topology of the standard chromatic subdivision and Weak Symmetry Breaking for 6 processes.

Dmitry N. Kozlov

CoRR, 2015

2014

Topology the immediate snapshot complexes.

Dmitry N. Kozlov

CoRR, 2014

Standard protocol complexes for the immediate snapshot read/write model.

Dmitry N. Kozlov

CoRR, 2014

2013

Topology of the view complex.

Dmitry N. Kozlov

CoRR, 2013

Distributed Computing Through Combinatorial Topology

Maurice Herlihy, Dmitry N. Kozlov, Sergio Rajsbaum

Morgan Kaufmann, ISBN: 978-0-12-404578-1, 2013

2012

Gathering identical autonomous systems on a circle using stigmergy.

Dmitry N. Kozlov

Distributed Comput., 2012

Applications of Combinatorial Topology to Computer Science (Dagstuhl Seminar 12121).

Lisbeth Fajstrup, Dmitry Feichtner-Kozlov, Maurice Herlihy

Dagstuhl Reports, 2012

2010

Some Conjectures Concerning Complexity of PL subdivisions.

Dmitry N. Kozlov

Proceedings of the workshop on Geometric and Topological Methods in Computer Science, 2010

2008

Combinatorial Algebraic Topology.

Dmitry N. Kozlov

Algorithms and computation in mathematics 21, Springer, ISBN: 978-3-540-73051-4, 2008

2006

Collapsing along monotone poset maps.

Dmitry N. Kozlov

Int. J. Math. Math. Sci., 2006

Homotopy Type of Complexes of Graph Homomorphisms between Cycles.

Sonja Lj. Cukic, Dmitry N. Kozlov

Discret. Comput. Geom., 2006

2005

Discrete Morse Theory for free chain complexes

Dmitry N. Kozlov

CoRR, 2005

2004

Directed Trees in a String, Real Polynomials with Triple Roots, and Chain Mails.

Dmitry N. Kozlov

Discret. Comput. Geom., 2004

2000

On subspace arrangements of type <i>D</i>.

Eva Maria Feichtner, Dmitry N. Kozlov

Discret. Math., 2000

1999

A Class of Hypergraph Arrangements with Shellable Intersection Lattice.

Dmitry N. Kozlov

J. Comb. Theory, Ser. A, 1999

Complexes of Directed Trees.

Dmitry N. Kozlov

J. Comb. Theory, Ser. A, 1999

Maximizing the Möbius Function of a Poset and the Sum of the Betti Numbers of the Order Complex.

Dmitry N. Kozlov

Comb., 1999

1997

Coins and Cones.

Dmitry N. Kozlov, Van H. Vu

J. Comb. Theory, Ser. A, 1997

Coins with Arbitrary Weights.

Noga Alon, Dmitry N. Kozlov

J. Algorithms, 1997

Convex Hulls of f- and $\beta$-Vectors.

Dmitry N. Kozlov

Discret. Comput. Geom., 1997

1996

The Geometry of Coin-Weighing Problems.

Noga Alon, Dmitry N. Kozlov, Van H. Vu

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996