Nasser Saheb-Djahromi · VLDB 2026 Research

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 17 · 3 first-authorDatabases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

4 papers

Distributed computing theory · 91% Graph algorithms and graph theory · 9%

Topics — the 7 heaviest of 7, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Distributed computing theory distributed graph algorithms	0.1	1	2010	About randomised distributed graph colouring and graph partition algorithms · Inf. Comput. 2010
Distributed computing theory broadcast	0.1	1	2006	Broadcast in the rendezvous model · Inf. Comput. 2006
Distributed computing theory leader election	0.1	1	2005	Locally guided randomized elections in trees: The totally fair case · Inf. Comput. 2005
Distributed computing theory › distributed algorithms randomized distributed algorithms	0.0	1	2003	Analysis of a randomized rendezvous algorithm · Inf. Comput. 2003
Distributed computing theory › mobile agents rendezvous	0.0	1	2003	Analysis of a randomized rendezvous algorithm · Inf. Comput. 2003
Graph algorithms and graph theory graph partitioning	0.0	1	2010	About randomised distributed graph colouring and graph partition algorithms · Inf. Comput. 2010
Distributed computing theory distributed algorithms	0.0	1	2005	Locally guided randomized elections in trees: The totally fair case · Inf. Comput. 2005

Methods — techniques the papers use, named apart from their topics

randomised algorithms · 0.1distributed algorithm · 0.1randomized algorithm analysis · 0.0

Year	Publication	Venue	Position
2013	On the time and the bit complexity of distributed randomised anonymous ring colouring Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari	Theor. Comput. Sci.	3
2011	An optimal bit complexity randomized distributed MIS algorithm Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari	Distributed Comput.	3
2010	Uniform election in trees and polyominoids Abdelaaziz El Hibaoui, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari	Discret. Appl. Math.	3
2010	About randomised distributed graph colouring and graph partition algorithms Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari	Inf. Comput.	3
2009	Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari	OPODIS	3
2009	An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari	SIROCCO	3
2006	Broadcast in the rendezvous model Philippe Duchon, Nicolas Hanusse, Nasser Saheb-Djahromi, Akka Zemmari	Inf. Comput.	3
2005	Locally guided randomized elections in trees: The totally fair case Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari	Inf. Comput.	2
2004	Broadcast in the Rendezvous Model Philippe Duchon, Nicolas Hanusse, Nasser Saheb-Djahromi, Akka Zemmari	STACS	3
2003	An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems Jean-Michel Couvreur, Nasser Saheb-Djahromi, Grégoire Sutre	LPAR	2
2003	A uniform randomized election in trees Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari	SIROCCO	2
2003	Analysis of a randomized rendezvous algorithm Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari	Inf. Comput.	2
2002	Randomized local elections Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari	Inf. Process. Lett.	2
1999	Non-Uniform Random Spanning Trees on Weighted Graphs Mohamed Mosbah 0001, Nasser Saheb-Djahromi	Theor. Comput. Sci.	2
1997	A Syntactic Approach to Random Walks on Graphs Mohamed Mosbah 0001, Nasser Saheb-Djahromi	WG	2
1996	Medians and Centres of Polyominoes Yves Métivier, Nasser Saheb-Djahromi	Inf. Process. Lett.	2
1989	Concurrency measure in commutation monoids Nasser Saheb-Djahromi	Discret. Appl. Math.	1
1980	CPO'S of Measures for Nondeterminism Nasser Saheb-Djahromi	Theor. Comput. Sci.	1
1978	Probabilistic LCF Nasser Saheb-Djahromi	MFCS	1