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.
EDBT 2026 Demo / reviewers in the wild / expert

Arthur S. Goldstein

dblp:76/4043 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1995
—ORCID · none

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

Theory of computation · 3 · 2 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
Algorithms and data structures · 87% Coding theory · 13%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures
search algorithms		 0.011993
A Fibonacci Version of Kraft's Inequality Applied to Discrete Unimodal Search · SIAM J. Comput. 1993
Coding theory › source coding › variable-length codes
kraft inequality		 0.011993
A Fibonacci Version of Kraft's Inequality Applied to Discrete Unimodal Search · SIAM J. Comput. 1993

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

probing analysis · 0.0fibonacci inequality · 0.0
YearPublicationVenuePosition
1995 The Complexity of Pursuit on a Graph
Arthur S. Goldstein, Edward M. Reingold
 Theor. Comput. Sci.1
1993 A Fibonacci Version of Kraft's Inequality Applied to Discrete Unimodal Search
abstract
A function is unimodal if it strictly increases to a unique maximum and then strictly decreases. The problem of determining the smallest possible interval containing the maximum of a unimodal function, by probing only at integer values is studied. In the finite case, the search takes place over the range 0 to N, while in the infinite case the search takes place over the nonnegative integers. The analyses are based on an unusual Fibonacci version of Kraft’s inequality.
Arthur S. Goldstein, Edward M. Reingold
 SIAM J. Comput.1
1992 "Lion and Man": Upper and Lower Bounds
abstract
Given a lion and a man, their initial positions, and restrictions on their ranges and speeds, how quickly can the lion get within a given distance from the man? We consider the case in which the lion and man are restricted to the interior of a circle and each is limited to the same speed. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
Laurent Alonso, Arthur S. Goldstein, Edward M. Reingold
 INFORMS J. Comput.2