Jordan Erenrich

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:17/461 · DBLP profile ↗

← Back

2ranked-venue papers

1as first author

0since 2021 · last 2004

—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author

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

2 papers

Algorithms and data structures · 53% Graph algorithms and graph theory · 32% Combinatorics and discrete mathematics · 15%

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

Topic	Papers	Last	Evidence papers
Graph algorithms and graph theory › graph sampling random walk sampling	1	2004	Towards Efficient Sampling: Exploiting Random Walk Strategies · AAAI 2004
Algorithms and data structures › randomized algorithms sampling	1	2004	Towards Efficient Sampling: Exploiting Random Walk Strategies · AAAI 2004
Algorithms and data structures › markov chains biased random walks	1	2003	Sampling Combinatorial Spaces Using Biased Random Walks · IJCAI 2003
Algorithms and data structures randomized algorithms	1	2003	Sampling Combinatorial Spaces Using Biased Random Walks · IJCAI 2003
Graph algorithms and graph theory random walk	1	2003	Sampling Combinatorial Spaces Using Biased Random Walks · IJCAI 2003
Algorithms and data structures › randomized algorithms › sampling markov chain monte carlo	1	2004	Towards Efficient Sampling: Exploiting Random Walk Strategies · AAAI 2004

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

random walk strategies · 0.0

Year	Publication	Venue	Position
2004	Towards Efficient Sampling: Exploiting Random Walk Strategies Wei Wei 0040, Jordan Erenrich, Bart Selman	AAAI	2
2003	Sampling Combinatorial Spaces Using Biased Random Walks Jordan Erenrich, Bart Selman	IJCAI	1