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

Ilan Bar-On

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

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

Systems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorTheory of computation · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%
Theoretical computer science
1 paper
Computational complexity · 100%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
parallel algorithms		 0.011985
Optimal Parallel Generation of a Computation Tree Form · ACM Trans. Program. Lang. Syst. 1985
Parallel and multicore computing › parallel algorithms › parallel symbolic computation
parallel expression evaluation		 0.011985
Optimal Parallel Generation of a Computation Tree Form · ACM Trans. Program. Lang. Syst. 1985
Computational complexity
computation tree		 0.011985
Optimal Parallel Generation of a Computation Tree Form · ACM Trans. Program. Lang. Syst. 1985
Parallel and multicore computing › parallel computation models
PRAM		 0.011985
Optimal Parallel Generation of a Computation Tree Form · ACM Trans. Program. Lang. Syst. 1985
YearPublicationVenuePosition
1991 Efficient logarithmic time parallel algorithms for the Cholesky decomposition and Gram-Schmidt process
Ilan Bar-On
 Parallel Comput.1
1987 A practical parallel algorithm for solving band symmetric positive definite systems of linear equations
abstract
We give a practical parallel algorithm for solving band symmetric positive definite systems of linear equations in O ( m * log n ) time using nm /log n processors. Here n denotes the system size and m its bandwidth. Hence, the algorithm is efficient. For tridiagonal systems, the algorithm runs in O (log n ) time using n /log n processors. Furthermore, an improved version runs in O (log m log n ) time using nm 2 /(log m log n ) processors.
Ilan Bar-On
 ACM Trans. Math. Softw.1
1985 Optimal Parallel Generation of a Computation Tree Form
abstract
Given a general arithmetic expression, we find a computation binary tree representation in O (log n ) time using n /log n processors on a concurrent-read, exclusive-write, parallel random-access machine. A new algorithm is introduced for this purpose. Unlike previous serial and parallel solutions, it is not based on using a stack.
Ilan Bar-On, Uzi Vishkin
 ACM Trans. Program. Lang. Syst.1