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

Josef Sprinzak

dblp:31/2447 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · none

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

Theory of computation · 2Artificial intelligence and machine learning · 1 · 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
1 paper
Computational geometry · 61% Combinatorics and discrete mathematics · 30% Algorithmic game theory and mechanism design · 9%

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

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics
combinatorial bounds		 0.011991
Matching Points into Noise Regions: Combinatorial Bounds and Algorithms · SODA 1991
Computational geometry
geometric matching		 0.011991
Matching Points into Noise Regions: Combinatorial Bounds and Algorithms · SODA 1991
Computational geometry › geometric matching
point set matching		 0.011991
Matching Points into Noise Regions: Combinatorial Bounds and Algorithms · SODA 1991
Algorithmic game theory and mechanism design
matching		 0.011991
Matching Points into Noise Regions: Combinatorial Bounds and Algorithms · SODA 1991
YearPublicationVenuePosition
1994 Affine point matching
Josef Sprinzak, Michael Werman
 Pattern Recognit. Lett.1
1992 Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms
abstract
We consider several cases of the point matching problem in which we are to find a transformation of a set of n points such that each transformed point lies in one of n given pairwise-disjoint “noise regions.” We prove upper and lower bounds on the number of possible matches, under a variety of types of transformations (rotations, translations, similarity) and noise regions (circles, squares, polygons). We also give efficient algorithms for computing the set of all possible matches, along with a corresponding transformation that realizes each match. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
Esther M. Arkin, Klara Kedem, Joseph S. B. Mitchell, Josef Sprinzak, Michael Werman
 INFORMS J. Comput.4
1991 Matching Points into Noise Regions: Combinatorial Bounds and Algorithms
Esther M. Arkin, Klara Kedem, Joseph S. B. Mitchell, Josef Sprinzak, Michael Werman
 SODA4