Tomer Even

Orcid: 0009-0001-8942-3637

According to our database1, Tomer Even authored at least 7 papers between 2022 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Output-sensitive approximate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate <i>k</i>-clique counts faster.
CoRR, March, 2025

Output-Sensitive Approximate Counting via a Measure-Bounded Hyperedge Oracle, or: How Asymmetry Helps Estimate k-Clique Counts Faster.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

When MIS and Maximal Matching are Easy in the Congested Clique.
Proceedings of the Structural Information and Communication Complexity, 2025

Dynamic Filter and Retrieval with One Access to Modifiable Memory.
Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2024
Faster Cycle Detection in the Congested Clique.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Fast Approximate Counting of Cycles.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2022
Prefix Filter: Practically and Theoretically Better Than Bloom.
Proc. VLDB Endow., 2022


  Loading...