#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2012

2016

- This year (0)
- Last 5 years (8)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Nikita Danilenko
- RAMICS
- 2012

- Rudolf Berghammer, Nikita Danilenko, Henning Schnoor
- RAMICS
- 2014

- Nikita Danilenko
- Trends in Functional Programming
- 2014

- Nikita Danilenko
- LOPSTR
- 2014

- Nikita Danilenko
- KDPD
- 2013

- Jan Christiansen, Nikita Danilenko, Sandra Dylus
- ICFP
- 2016

The combination of non-determinism and sorting is mostly associated with permutation sort, a sorting algorithm that is not very useful for sorting and has an awful running time. In this paper we look at the combination of non-determinism and sorting in a different light: given a sorting function, we apply it to a non-deterministic predicate to gain a… (More)

- Nikita Danilenko
- WLP/WFLP
- 2014

Graph algorithms that are based on the computation of one or more paths are often written in an implicitly non-deterministic way, which suggests that the result of the algorithm does not depend on a particular path, but any path that satisfies a given property. Such algorithms provide an additional challenge in typical implementations, because one needs to… (More)

- Rudolf Berghammer, Nikita Danilenko, Peter Höfner, Insa Stucke
- Discrete Mathematics
- 2016

Based on Y. Kawahara’s characterisation of the cardinality of relations we derive some fundamental properties of cardinalities concerning vectors, points and mapping-related relations. As applications of these results we verify some properties of linear orders and graphs in a calculational manner. These include the cardinalities of rooted trees and some… (More)

- ‹
- 1
- ›