default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSarel Cohen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Sebastian Reiche, Sarel Cohen, Kirill Simonov, Tobias Friedrich:
Integrating higher-order relations for enhanced twitter bot detection. Soc. Netw. Anal. Min. 14(1): 207 (2024)- [j3]Davide Bilò
, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. TheoretiCS 3 (2024) - [c36]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Improved Distance (Sensitivity) Oracles with Subquadratic Space. FOCS 2024: 1550-1558 - [c35]Daniel Cohen, Sarel Cohen, Dalit Naor, Daniel G. Waddington, Moshik Hershcovitch:
Dictionary Based Cache Line Compression. HotStorage 2024 - [c34]Judith Herrmann, Raphael Kunert, Ron Hachmon, Aviv Markus, Allison Gunby-Mann, Sarel Cohen, Tobias Friedrich, Peter Chin:
Detecting Continuous Gravitational Waves Using Generated Training Data. ICASSP 2024: 146-150 - [c33]Yinon Horev, Shiraz Shay, Sarel Cohen, Tobias Friedrich, Davis Issac, Lior Kamma, Aikaterini Niklanovits, Kirill Simonov:
A Contraction Tree SAT Encoding for Computing Twin-Width. PAKDD (2) 2024: 444-456 - [d1]Thomas Bläsius, Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca:
Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation (Data and Code). Zenodo, 2024
- [i21]Thomas Bläsius, Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca:
Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation. CoRR abs/2402.05534 (2024) - [i20]Sarel Cohen, Lior Kamma, Aikaterini Niklanovits:
A New Approach for Approximating Directed Rooted Networks. CoRR abs/2407.07543 (2024) - [i19]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Improved Distance (Sensitivity) Oracles with Subquadratic Space. CoRR abs/2408.10014 (2024) - 2023
- [c32]Francesco Quinzan, Rajiv Khanna, Moshik Hershcovitch, Sarel Cohen, Daniel G. Waddington, Tobias Friedrich, Michael W. Mahoney:
Fast Feature Selection with Fairness Constraints. AISTATS 2023: 7800-7823 - [c31]Sebastian Reiche, Sarel Cohen, Kirill Simonov, Tobias Friedrich:
Beyond Following: Augmenting Bot Detection with the Integration of Behavioral Patterns. COMPLEX NETWORKS (1) 2023: 250-259 - [c30]Ikeoluwa Abioye, Allison Gunby-Mann, Xu Wang, Sarel Cohen, Peter Chin:
Learned Approximate Distance Labels for Graphs. COMPLEX NETWORKS (1) 2023: 339-350 - [c29]Davin Jeong, Allison Gunby-Mann, Sarel Cohen, Maximilian Katzmann, Chau Pham, Arnav Bhakta, Tobias Friedrich, Peter Chin:
Deep Distance Sensitivity Oracles. COMPLEX NETWORKS (1) 2023: 452-463 - [c28]Frank Pacini, Allison Gunby-Mann, Sarel Cohen, Peter Chin:
ANEDA: Adaptable Node Embeddings for Shortest Path Distance Approximation. HPEC 2023: 1-7 - [c27]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Fault-Tolerant ST-Diameter Oracles. ICALP 2023: 24:1-24:20 - [c26]Bashini K. Mahaarachchi, Sarel Cohen, Bodo Bookhagen, Vanja Doskoc, Tobias Friedrich:
Sustainable On-Street Parking Mapping with Deep Learning and Airborne Imagery. IDEAL 2023: 209-221 - [c25]Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas:
Temporal Network Creation Games. IJCAI 2023: 2511-2519 - [c24]Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca:
The Common-Neighbors Metric Is Noise-Robust and Reveals Substructures of Real-World Networks. PAKDD (1) 2023: 67-79 - [c23]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. STOC 2023: 1396-1409 - [c22]Daniel Cohen, Sarel Cohen, Dalit Naor, Daniel G. Waddington, Moshik Hershcovitch:
Cache Line Deltas Compression. SYSTOR 2023: 145 - [c21]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Compact Distance Oracles with Large Sensitivity and Low Stretch. WADS 2023: 149-163 - [c20]Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, Leo Wendt:
Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover. SEA 2023: 10:1-10:14 - [i18]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Compact Distance Oracles with Large Sensitivity and Low Stretch. CoRR abs/2304.14184 (2023) - [i17]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Fault-Tolerant ST-Diameter Oracles. CoRR abs/2305.03697 (2023) - [i16]Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas:
Temporal Network Creation Games. CoRR abs/2305.07494 (2023) - [i15]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. CoRR abs/2305.11580 (2023) - [i14]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs. CoRR abs/2307.11677 (2023) - 2022
- [c19]Philipp Hildebrandt, Maximilian Schulze, Sarel Cohen, Vanja Doskoc, Raid Saabni, Tobias Friedrich:
Optical character recognition guided image super resolution. DocEng 2022: 14:1-14:4 - [c18]Andrew Wood, Moshik Hershcovitch, Ilias Ennmouri, Weiyu Zong, Saurav Chennuri, Sarel Cohen, Swaminathan Sundararaman, Daniel G. Waddington, Sang (Peter) Chin:
Towards Fast Crash-Consistent Cluster Checkpointing. HPEC 2022: 1-8 - [c17]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. ICALP 2022: 22:1-22:19 - [c16]Maximilian Böther, Otto Kißig, Martin Taraz, Sarel Cohen, Karen Seidel, Tobias Friedrich:
What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization. ICLR 2022 - [c15]Ryan Yu, Andrew Wood, Sarel Cohen, Moshik Hershcovitch, Daniel G. Waddington, Peter Chin:
Biologically Plausible Complex-Valued Neural Networks and Model Optimization. AIAI (1) 2022: 369-382 - [c14]Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger:
Fixed-Parameter Sensitivity Oracles. ITCS 2022: 23:1-23:18 - [c13]Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, Leo Wendt:
PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex Set. IPEC 2022: 28:1-28:4 - [c12]Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca, Thomas Sauerwald:
Accelerated Information Dissemination on Networks with Local and Global Edges. SIROCCO 2022: 79-97 - [i13]Maximilian Böther, Otto Kißig, Martin Taraz, Sarel Cohen, Karen Seidel, Tobias Friedrich:
What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization. CoRR abs/2201.10494 (2022) - [i12]Andrew Wood, Moshik Hershcovitch, Daniel G. Waddington, Sarel Cohen, Peter Chin:
Non-Volatile Memory Accelerated Posterior Estimation. CoRR abs/2202.10522 (2022) - [i11]Andrew Wood, Moshik Hershcovitch, Daniel G. Waddington, Sarel Cohen, Meredith Wolf, Hongjun Suh, Weiyu Zong, Peter Chin:
Non-Volatile Memory Accelerated Geometric Multi-Scale Resolution Analysis. CoRR abs/2202.11518 (2022) - [i10]Francesco Quinzan, Rajiv Khanna, Moshik Hershcovitch, Sarel Cohen, Daniel G. Waddington, Tobias Friedrich, Michael W. Mahoney:
Fast Feature Selection with Fairness Constraints. CoRR abs/2202.13718 (2022) - [i9]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. CoRR abs/2204.10679 (2022) - [i8]Davin Jeong, Chau Pham, Arnav Bhakta, Sarel Cohen, Maximilian Katzmann, Tobias Friedrich, Sang (Peter) Chin:
Deep Distance Sensitivity Oracles. CoRR abs/2211.02681 (2022) - 2021
- [b1]Sarel Cohen:
Dynamic and Fault-Tolerant Data-Structures and Algorithms. Tel Aviv University, Israel, 2021 - [c11]Sarel Cohen, Moshik Hershcovitch, Martin Taraz, Otto Kißig, Andrew Wood, Daniel G. Waddington, Peter Chin, Tobias Friedrich:
Drug Repurposing Using Link Prediction on Knowledge Graphs with Applications to Non-volatile Memory. COMPLEX NETWORKS 2021: 742-753 - [c10]Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. ESA 2021: 18:1-18:17 - [c9]Andrew Wood, Moshik Hershcovitch, Daniel G. Waddington, Sarel Cohen, Meredith Wolf, Hongjun Suh, Weiyu Zong, Peter Chin:
Non-Volatile Memory Accelerated Geometric Multi-Scale Resolution Analysis. HPEC 2021: 1-7 - [c8]Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Space-Efficient Fault-Tolerant Diameter Oracles. MFCS 2021: 18:1-18:16 - [i7]Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. CoRR abs/2106.15731 (2021) - [i6]Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Space-Efficient Fault-Tolerant Diameter Oracles. CoRR abs/2107.03485 (2021) - [i5]Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger:
Fixed-Parameter Sensitivity Oracles. CoRR abs/2112.03059 (2021) - 2020
- [c7]Sharon Fogel, Hadar Averbuch-Elor, Sarel Cohen, Shai Mazor, Roee Litman:
ScrabbleGAN: Semi-Supervised Varying Length Handwritten Text Generation. CVPR 2020: 4323-4332 - [c6]Shiri Chechik, Sarel Cohen:
Distance sensitivity oracles with subcubic preprocessing time and fast query time. STOC 2020: 1375-1388 - [i4]Sharon Fogel, Hadar Averbuch-Elor, Sarel Cohen, Shai Mazor, Roee Litman:
ScrabbleGAN: Semi-Supervised Varying Length Handwritten Text Generation. CoRR abs/2003.10557 (2020)
2010 – 2019
- 2019
- [c5]Noga Alon, Shiri Chechik, Sarel Cohen:
Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles. ICALP 2019: 12:1-12:14 - [c4]Shiri Chechik, Sarel Cohen:
Near Optimal Algorithms For The Single Source Replacement Paths Problem. SODA 2019: 2090-2109 - [i3]Noga Alon, Shiri Chechik, Sarel Cohen:
Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles. CoRR abs/1905.07483 (2019) - 2018
- [j2]Yossi Azar, Sarel Cohen:
An improved algorithm for online machine minimization. Oper. Res. Lett. 46(1): 128-133 (2018) - [c3]Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc:
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. ICALP 2018: 7:1-7:16 - 2017
- [c2]Shiri Chechik, Sarel Cohen, Amos Fiat, Haim Kaplan:
(1 + ∊)-Approximate f-Sensitive Distance Oracles. SODA 2017: 1479-1496 - [i2]Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc:
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. CoRR abs/1711.06625 (2017) - 2015
- [j1]Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan:
Minimal indices for predecessor search. Inf. Comput. 240: 12-30 (2015) - 2013
- [c1]Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan:
Minimal Indices for Successor Search - (Extended Abstract). MFCS 2013: 278-289 - [i1]Sarel Cohen, Amos Fiat, Moshe Hershcovitch, Haim Kaplan:
Minimal Indices for Successor Search. CoRR abs/1306.3772 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
