default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOded Margalit
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Irina Maliukov
, Gera Weiss, Oded Margalit, Achiya Elyasaf:
Evolving Assembly Code in an Adversarial Environment. GECCO Companion 2024: 723-726- [i4]Irina Maliukov, Gera Weiss, Oded Margalit, Achiya Elyasaf:
Evolving Assembly Code in an Adversarial Environment. CoRR abs/2403.19489 (2024) - 2023
- [j12]Achiya Elyasaf, Eitan Farchi, Oded Margalit, Gera Weiss, Yeshayahu Weiss:
Generalized Coverage Criteria for Combinatorial Sequence Testing. IEEE Trans. Software Eng. 49(8): 4023-4034 (2023) - [c17]Ilia Shevrin, Oded Margalit:
Detecting Multi-Step IAM Attacks in AWS Environments via Model Checking. USENIX Security Symposium 2023: 6025-6042 - [i3]Pawel Cyprys, Shlomi Dolev, Oded Margalit:
OWF Candidates Based on: Xors, Error Detection Codes, Permutations, Polynomials, Interaction and Nesting. IACR Cryptol. ePrint Arch. 2023: 1033 (2023) - 2022
- [j11]Avi Shaked, Oded Margalit:
Sustainable Risk Identification Using Formal Ontologies. Algorithms 15(9): 316 (2022) - [c16]Dana Fisman, Joshua Grogin, Oded Margalit, Gera Weiss:
The Normalized Edit Distance with Uniform Operation Costs Is a Metric. CPM 2022: 17:1-17:17 - [c15]Avi Shaked, Oded Margalit:
OnToRisk - a formal ontology approach to automate cyber security risk identification. SoSE 2022: 74-79 - [i2]Achiya Elyasaf, Eitan Farchi, Oded Margalit, Gera Weiss, Yeshayahu Weiss:
Combinatorial Sequence Testing Using Behavioral Programming and Generalized Coverage Criteria. CoRR abs/2201.00522 (2022) - [i1]Dana Fisman, Joshua Grogin, Oded Margalit, Gera Weiss:
The Normalized Edit Distance with Uniform Operation Costs is a Metric. CoRR abs/2201.06115 (2022) - 2021
- [j10]Itay Hazan, Oded Margalit, Lior Rokach:
Supporting unknown number of users in keystroke dynamics models. Knowl. Based Syst. 221: 106982 (2021) - [c14]Michael Berlin, Oded Margalit, Gera Weiss:
DepthStAr: Deep Strange Arguments Detection. CSCML 2021: 71-85 - [e1]Shlomi Dolev, Oded Margalit, Benny Pinkas, Alexander A. Schwarzmann:
Cyber Security Cryptography and Machine Learning - 5th International Symposium, CSCML 2021, Be'er Sheva, Israel, July 8-9, 2021, Proceedings. Lecture Notes in Computer Science 12716, Springer 2021, ISBN 978-3-030-78085-2 [contents] - 2020
- [j9]Itay Hazan, Oded Margalit, Lior Rokach:
Keystroke dynamics obfuscation using key grouping. Expert Syst. Appl. 143 (2020) - [j8]Roni Mateless, Daniel Rejabek, Oded Margalit, Robert Moskovitch:
Decompiled APK based malicious code classification. Future Gener. Comput. Syst. 110: 135-147 (2020)
2010 – 2019
- 2019
- [j7]Itay Hazan, Oded Margalit, Lior Rokach:
Securing keystroke dynamics from replay attacks. Appl. Soft Comput. 85 (2019) - 2018
- [c13]Oded Margalit:
Brief Announcement: Adversarial Evasion of an Adaptive Version of Western Electric Rules. CSCML 2018: 278-282 - 2017
- [c12]Gal Frishman, Yaniv Ben-Itzhak, Oded Margalit:
Cluster-Based Load Balancing for Better Network Security. Big-DAMA@SIGCOMM 2017: 7-12 - 2016
- [c11]Oded Margalit:
Using Computer Programming Competition for Cyber Education. SwSTE 2016: 104-107 - 2014
- [c10]Gadi Aleksandrowicz, Alexander Ivrii, Oded Margalit, Dan Rasin:
Generating Modulo-2 Linear Invariants for Hardware Model Checking. Haifa Verification Conference 2014: 54-67 - [c9]Oded Margalit:
On the riddle of coding equality function in the garden hose model. ITA 2014: 1-5 - 2013
- [c8]Danny Harnik, Ronen I. Kat, Oded Margalit, Dmitry Sotnikov, Avishay Traeger:
To Zip or not to Zip: effective resource usage for real-time compression. FAST 2013: 229-242 - [c7]Oded Margalit:
Better Bounds for Event Sequencing Testing. ICST Workshops 2013: 281-284 - 2012
- [c6]Danny Harnik, Oded Margalit, Dalit Naor, Dmitry Sotnikov, Gil Vernik:
Estimation of deduplication ratios in large data sets. MSST 2012: 1-11 - [c5]Yael Ben-Haim, Alexander Ivrii, Oded Margalit, Arie Matsliah:
Perfect Hashing and CNF Encodings of Cardinality Constraints. SAT 2012: 397-409 - 2011
- [j6]Ehud Aharoni, Shai Fine, Yaara Goldschmidt, Ofer Lavi, Oded Margalit, Michal Rosen-Zvi, Lavi Shpigelman:
Smarter log analysis. IBM J. Res. Dev. 55(5): 10 (2011)
2000 – 2009
- 2008
- [c4]Shlomo Hoory, Oded Margalit:
Finding the Rare Cube. ALT 2008: 344-358
1990 – 1999
- 1997
- [j5]Zvi Galil, Oded Margalit:
All Pairs Shortest Distances for Graphs with Small Integer Length Edges. Inf. Comput. 134(2): 103-139 (1997) - [j4]Zvi Galil, Oded Margalit:
All Pairs Shortest Paths for Graphs with Small Integer Length Edges. J. Comput. Syst. Sci. 54(2): 243-254 (1997) - [j3]Noga Alon, Zvi Galil, Oded Margalit:
On the Exponent of the All Pairs Shortest Path Problem. J. Comput. Syst. Sci. 54(2): 255-262 (1997) - 1993
- [j2]Zvi Galil, Oded Margalit:
Witnesses for Boolean Matrix Multiplication and for Transitive Closure. J. Complex. 9(2): 201-221 (1993) - 1992
- [b1]Oded Margalit:
Algorithms for the all pairs shortest paths problem. Tel Aviv University, Israel, 1992 - [c3]Noga Alon, Zvi Galil, Oded Margalit, Moni Naor:
Witnesses for Boolean Matrix Multiplication and for Shortest Paths. FOCS 1992: 417-426 - 1991
- [j1]Zvi Galil, Oded Margalit:
An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem. SIAM J. Comput. 20(6): 1157-1189 (1991) - [c2]Noga Alon, Zvi Galil, Oded Margalit:
On the Exponent of the All Pairs Shortest Path Problem. FOCS 1991: 569-575 - [c1]Zvi Galil, Oded Margalit:
An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem. ICALP 1991: 719-727
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-10-07 21:18 CEST 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:
