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 SIGIR 2026 / reviewers in the wild / expert

Louise Laforest

dblp:83/6881 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none

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

Human-computer interaction and ubiquitous computing · 1Theory of computation · 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
1 paper
Algorithms and data structures · 50% Information theory · 50%

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

TopicWeightPapersLastEvidence papers
Information theory › statistical inference › asymptotic theory
asymptotic distribution		 0.011990
An Analysis of Random d-Dimensional Quad Trees · SIAM J. Comput. 1990
Algorithms and data structures › analysis of algorithms
probabilistic analysis of algorithms		 0.011990
An Analysis of Random d-Dimensional Quad Trees · SIAM J. Comput. 1990

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

probabilistic analysis · 0.0moment computation · 0.0
YearPublicationVenuePosition
2007 Extending a marking tool with simple support for testing
abstract
Oto is a customizable and extensible marking tool which aims at providing timely feedback to students. Based on simple test cases description formats, Oto also includes operations that help students easily test-even "mark"-their own programs.
Guy Tremblay, Louise Laforest, Aziz Salah
 ITiCSE2
1990 An Analysis of Random d-Dimensional Quad Trees
abstract
It is shown that the depth of the last node inserted in a random quad tree constructed from independent uniform $[0,1]^d $ random vectors is in probability asymptotic to $({2 / d}) \log n$, where log denotes the natural logarithm. In addition, for $d = 2$, exact values are obtained for all the moments of the depth of the last node.
Luc Devroye, Louise Laforest
 SIAM J. Comput.2