Nikita Danilenko

According to our database, Nikita Danilenko authored at least 9 papers between 2012 and 2016.

Collaborative distances:

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

2016

Cardinality of relations with applications.

Rudolf Berghammer, Nikita Danilenko, Peter Höfner, Insa Stucke

Discret. Math., 2016

All sorts of permutations (functional pearl).

Jan Christiansen, Nikita Danilenko, Sandra Dylus

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

2015

Designing Functional Implementations of Graph Algorithms (Entwurf funktionaler Implementierungen von Graphalgorithmen)

Nikita Danilenko

PhD thesis, 2015

2014

Exploring Non-Determinism in Graph Algorithms.

Nikita Danilenko

Proceedings of the 28th Workshop on (Constraint) Logic Programming (WLP 2014) Proceedings of the 23rd International Workshop on Functional and (Constraint) Logic Programming, 2014

Graph Problems and Vector-Matrix Multiplications in Haskell.

Nikita Danilenko

Proceedings of the Trends in Functional Programming, 2014

Functional Kleene Closures.

Nikita Danilenko

Proceedings of the Logic-Based Program Synthesis and Transformation, 2014

Relation Algebra and RelView Applied to Approval Voting.

Rudolf Berghammer, Nikita Danilenko, Henning Schnoor

Proceedings of the Relational and Algebraic Methods in Computer Science, 2014

2013

And... Action! - Monoid Actions and (Pre)orders.

Nikita Danilenko

Proceedings of the Declarative Programming and Knowledge Management, 2013

2012

Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings.

Nikita Danilenko

Proceedings of the Relational and Algebraic Methods in Computer Science, 2012