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

Alexander Mozeika

dblp:04/7254 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · unresolved

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

Theory 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.

Theoretical computer science
1 paper
Computational complexity · 100%

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

TopicWeightPapersLastEvidence papers
Computational complexity
boolean function computation		 0.212015
On Reliable Computation by Noisy Random Boolean Formulas · IEEE Trans. Inf. Theory 2015
Computational complexity › computational models
noisy computation		 0.212015
On Reliable Computation by Noisy Random Boolean Formulas · IEEE Trans. Inf. Theory 2015

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

probabilistic analysis · 0.2
YearPublicationVenuePosition
2015 On Reliable Computation by Noisy Random Boolean Formulas
abstract
We study noisy computation in randomly generated k-ary Boolean formulas. We establish bounds on the noise level above which the results of computation by random formulas are not reliable. This bound is saturated by formulas constructed from a single majority-like gate. We show that these gates can be used to compute any Boolean function reliably below the noise bound.
Alexander Mozeika, David Saad
 IEEE Trans. Inf. Theory1