Oded Margalit

Orcid: 0000-0002-2026-2601

According to our database1, Oded Margalit authored at least 30 papers between 1991 and 2023.

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

2023
Generalized Coverage Criteria for Combinatorial Sequence Testing.
IEEE Trans. Software Eng., August, 2023

OWF Candidates Based on: Xors, Error Detection Codes, Permutations, Polynomials, Interaction and Nesting.
IACR Cryptol. ePrint Arch., 2023

Detecting Multi-Step IAM Attacks in AWS Environments via Model Checking.
Proceedings of the 32nd USENIX Security Symposium, 2023

2022
Combinatorial Sequence Testing Using Behavioral Programming and Generalized Coverage Criteria.
CoRR, 2022

Sustainable Risk Identification Using Formal Ontologies.
Algorithms, 2022

OnToRisk - a formal ontology approach to automate cyber security risk identification.
Proceedings of the 17th Annual System of Systems Engineering Conference, 2022

The Normalized Edit Distance with Uniform Operation Costs Is a Metric.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021
Supporting unknown number of users in keystroke dynamics models.
Knowl. Based Syst., 2021

DepthStAr: Deep Strange Arguments Detection.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2021

2020
Decompiled APK based malicious code classification.
Future Gener. Comput. Syst., 2020

Keystroke dynamics obfuscation using key grouping.
Expert Syst. Appl., 2020

2019
Securing keystroke dynamics from replay attacks.
Appl. Soft Comput., 2019

2018
Brief Announcement: Adversarial Evasion of an Adaptive Version of Western Electric Rules.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2018

2017
Cluster-Based Load Balancing for Better Network Security.
Proceedings of the Workshop on Big Data Analytics and Machine Learning for Data Communication Networks, 2017

2016
Using Computer Programming Competition for Cyber Education.
Proceedings of the 2016 IEEE International Conference on Software Science, 2016

2014
On the riddle of coding equality function in the garden hose model.
Proceedings of the 2014 Information Theory and Applications Workshop, 2014

Generating Modulo-2 Linear Invariants for Hardware Model Checking.
Proceedings of the Hardware and Software: Verification and Testing, 2014

2013
Better Bounds for Event Sequencing Testing.
Proceedings of the Sixth IEEE International Conference on Software Testing, 2013

To Zip or not to Zip: effective resource usage for real-time compression.
Proceedings of the 11th USENIX conference on File and Storage Technologies, 2013

2012
Perfect Hashing and CNF Encodings of Cardinality Constraints.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Estimation of deduplication ratios in large data sets.
Proceedings of the IEEE 28th Symposium on Mass Storage Systems and Technologies, 2012

2011
Smarter log analysis.
IBM J. Res. Dev., 2011

2008
Finding the Rare Cube.
Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

1997
All Pairs Shortest Paths for Graphs with Small Integer Length Edges.
J. Comput. Syst. Sci., 1997

On the Exponent of the All Pairs Shortest Path Problem.
J. Comput. Syst. Sci., 1997

All Pairs Shortest Distances for Graphs with Small Integer Length Edges.
Inf. Comput., 1997

1993
Witnesses for Boolean Matrix Multiplication and for Transitive Closure.
J. Complex., 1993

1992
Algorithms for the all pairs shortest paths problem
PhD thesis, 1992

Witnesses for Boolean Matrix Multiplication and for Shortest Paths
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem.
SIAM J. Comput., 1991


  Loading...