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

Jenny Law

dblp:51/4972 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none

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

Theory 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
Computational complexity · 100%

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

TopicWeightPapersLastEvidence papers
Computational complexity › counting problems › approximate counting
permanent approximation
0.112008
Fast approximation of the permanent for very dense problems · SODA 2008

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

approximation algorithm · 0.1
YearPublicationVenuePosition
2008 Fast approximation of the permanent for very dense problems
Mark Huber, Jenny Law
SODA2