Bruno Durand

Follow

Generating author description...

All published works

Action	Title	Year	Authors
+	Infinite time Turing machines for elementary proofs on recursive reals	2024	Khalid Benjelloun Bruno Durand
+	Centennial Seminar on Kolmogorov Complexity and Applications (Dagstuhl Seminar 03181)	2021	Bruno Durand Leonid A. Levin Wolfgang Merkle Alexander Shen Paul Vitányi
+	1D Effectively Closed Subshifts and 2D Tilings	2010	Bruno Durand Andrei Romashchenko Alexander Shen
+	All-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time	2005	Surender Baswana Vishrut Goyal Sandeep Sen Volker Diekert Bruno Durand
+	Descriptive complexity of computable sequences	2002	Bruno Durand Alexander Shen Nikolay Vereshchagin
+	Descriptive complexity of computable sequences	2001	Bruno Durand Alexander Shen Nikolay Vereshchagin
+	Descriptive Complexity of Computable Sequences	1999	Bruno Durand Alexander Shen Nikolai Vereshagin
+ PDF Chat	Do most strong definitions of randomness exist?	1998	Bruno Durand Vladimir Kanovei Vladimir Uspensky Nikolai Vereshagin
+ PDF Chat	Deterministic rational transducers and random sequences	1998	Sylvain Porrot Max Dauchet Bruno Durand Nikolay Vereshchagin
+	Comparison between the complexity of a function and the complexity of its graph	1998	Bruno Durand Sylvain Porrot

Common Coauthors

Coauthor	Papers Together
Bruno Durand	9
Alexander Shen	5
Nikolay Vereshchagin	3
Nikolai Vereshagin	2
Sylvain Porrot	2
Wolfgang Merkle	1
Surender Baswana	1
Leonid A. Levin	1
Max Dauchet	1
Vladimir Kanovei	1
Vladimir Uspensky	1
Vishrut Goyal	1
Sandeep Sen	1
Khalid Benjelloun	1
Paul Vitányi	1
Andrei Romashchenko	1
Volker Diekert	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS	1970	Alexander K. Zvonkin Leonid A. Levin	3
+ PDF Chat	Relations between varieties of kolmogorov complexities	1996	Vladimir Uspensky Alexander Shen	3
+	A variant of the Kolmogorov concept of complexity	1969	D.W. Loveland	3
+	An Introduction to Kolmogorov Complexity and Its Applications	2019	Ming Li Paul Vitányi	2
+	Descriptive Complexity of Computable Sequences	1999	Bruno Durand Alexander Shen Nikolai Vereshagin	2
+	On the dynamics and recursive properties of multidimensional symbolic systems	2008	Michael Hochman	1
+	The definition of random sequences	1966	Per Martin-Löf	1
+	Undecidability and nonperiodicity for tilings of the plane	1971	Raphael M. Robinson	1
+ PDF Chat	A New Approach to Formal Language Theory by Kolmogorov Complexity	1995	Ming Li Paul Vitányi	1
+	Fixed-point tile sets and their applications	2009	Bruno Durand Andrei Romashchenko Alexander Shen	1
+ PDF Chat	Complex tilings	2008	Bruno Durand Leonid A. Levin Alexander Shen	1
+ PDF Chat	Deterministic rational transducers and random sequences	1998	Sylvain Porrot Max Dauchet Bruno Durand Nikolay Vereshchagin	1
+ PDF Chat	Fixed Point and Aperiodic Tilings	2008	Bruno Durand Andrei Romashchenko Alexander Shen	1
+	Comparison between the complexity of a function and the complexity of its graph	1998	Bruno Durand Sylvain Porrot	1
+ PDF Chat	Effective Closed Subshifts in 1D Can Be Implemented in 2D	2010	Bruno Durand Andrei Romashchenko Alexander Shen	1
+	Comparison between the complexity of a function and the complexity of its graph	2002	Bruno Durand Sylvain Porrot	1
+	The undecidability of the domino problem	1966	Robert E. Berger	1