Sarel Cohen

Orcid: 0000-0003-4578-1245

According to our database1, Sarel Cohen authored at least 47 papers between 2013 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Integrating higher-order relations for enhanced twitter bot detection.
Soc. Netw. Anal. Min., December, 2024

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation (Data and Code).
Dataset, February, 2024

Approximate Distance Sensitivity Oracles in Subquadratic Space.
TheoretiCS, 2024

Improved Distance (Sensitivity) Oracles with Subquadratic Space.
CoRR, 2024

A New Approach for Approximating Directed Rooted Networks.
CoRR, 2024

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation.
CoRR, 2024

A Contraction Tree SAT Encoding for Computing Twin-Width.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2024

Detecting Continuous Gravitational Waves Using Generated Training Data.
Proceedings of the IEEE International Conference on Acoustics, 2024

Dictionary Based Cache Line Compression.
Proceedings of the 16th ACM Workshop on Hot Topics in Storage and File Systems, 2024

2023
Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs.
CoRR, 2023

Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Compact Distance Oracles with Large Sensitivity and Low Stretch.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Cache Line Deltas Compression.
Proceedings of the 16th ACM International Conference on Systems and Storage, 2023

The Common-Neighbors Metric Is Noise-Robust and Reveals Substructures of Real-World Networks.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2023

Temporal Network Creation Games.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Sustainable On-Street Parking Mapping with Deep Learning and Airborne Imagery.
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2023, 2023

Fault-Tolerant ST-Diameter Oracles.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

ANEDA: Adaptable Node Embeddings for Shortest Path Distance Approximation.
Proceedings of the IEEE High Performance Extreme Computing Conference, 2023

Beyond Following: Augmenting Bot Detection with the Integration of Behavioral Patterns.
Proceedings of the Complex Networks & Their Applications XII, 2023

Deep Distance Sensitivity Oracles.
Proceedings of the Complex Networks & Their Applications XII, 2023

Learned Approximate Distance Labels for Graphs.
Proceedings of the Complex Networks & Their Applications XII, 2023

Fast Feature Selection with Fairness Constraints.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Deep Distance Sensitivity Oracles.
CoRR, 2022

Non-Volatile Memory Accelerated Posterior Estimation.
CoRR, 2022

Accelerated Information Dissemination on Networks with Local and Global Edges.
Proceedings of the Structural Information and Communication Complexity, 2022

PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex Set.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Fixed-Parameter Sensitivity Oracles.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Biologically Plausible Complex-Valued Neural Networks and Model Optimization.
Proceedings of the Artificial Intelligence Applications and Innovations, 2022

What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Towards Fast Crash-Consistent Cluster Checkpointing.
Proceedings of the IEEE High Performance Extreme Computing Conference, 2022

Optical character recognition guided image super resolution.
Proceedings of the 22nd ACM Symposium on Document Engineering, 2022

2021
Dynamic and Fault-Tolerant Data-Structures and Algorithms
PhD thesis, 2021

Space-Efficient Fault-Tolerant Diameter Oracles.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Non-Volatile Memory Accelerated Geometric Multi-Scale Resolution Analysis.
Proceedings of the 2021 IEEE High Performance Extreme Computing Conference, 2021

Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Drug Repurposing Using Link Prediction on Knowledge Graphs with Applications to Non-volatile Memory.
Proceedings of the Complex Networks & Their Applications X - Volume 2, Proceedings of the Tenth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2021, Madrid, Spain, November 30, 2021

2020
Distance sensitivity oracles with subcubic preprocessing time and fast query time.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

ScrabbleGAN: Semi-Supervised Varying Length Handwritten Text Generation.
Proceedings of the 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020

2019
Near Optimal Algorithms For The Single Source Replacement Paths Problem.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
An improved algorithm for online machine minimization.
Oper. Res. Lett., 2018

Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
(1 + ∊)-Approximate <i>f</i>-Sensitive Distance Oracles.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2015
Minimal indices for predecessor search.
Inf. Comput., 2015

2013
Minimal Indices for Successor Search.
CoRR, 2013

Minimal Indices for Successor Search - (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013


  Loading...