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

Igal Golan

dblp:07/5717 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1988
—ORCID · none

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

Theory of computation · 2 · 2 first-authorArtificial 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
Mathematical optimization · 33% Approximation and online algorithms · 33% Coding theory · 33%

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

TopicWeightPapersLastEvidence papers
Approximation and online algorithms › approximation algorithms
approximation ratio analysis		 0.011981
Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms · SIAM J. Comput. 1981
Coding theory › error-correcting codes › coding bounds
asymptotic bounds		 0.011981
Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms · SIAM J. Comput. 1981
Mathematical optimization › optimization
packing algorithms		 0.011981
Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms · SIAM J. Comput. 1981

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

worst-case analysis · 0.0
YearPublicationVenuePosition
1988 An active bilingual lexicon for machine translation
Igal Golan, Shalom Lappin, Mori Rimon
 COLING1
1981 Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
abstract
Two orthogonal oriented two-dimensional, packing algorithms are presented and their behavior is analyzed under several assumptions. For one of the algorithms we show that the ratio of the height used by the algorithm to the optimal height is asymptotically bounded by $\frac{4}{3}$. This bound is an improvement over similar bounds for previously proposed algorithms.
Igal Golan
 SIAM J. Comput.1
1977 Conditional Grammars
Igal Golan
 J. Comput. Syst. Sci.1