# Danny Hendler

According to our database

Collaborative distances:

^{1}, Danny Hendler authored at least 75 papers between 1993 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Upper bounds for multi-level multi-server paging.

Inf. Process. Lett., 2019

2018

Detection of malicious webmail attachments based on propagation patterns.

Knowl.-Based Syst., 2018

Scalable Detection of Server-Side Polymorphic Malware.

Knowl.-Based Syst., 2018

Early detection of spamming accounts in large-Scale service provider networks.

Knowl.-Based Syst., 2018

Ransomware prevention using application authentication-based file access control.

Proceedings of the 33rd Annual ACM Symposium on Applied Computing, 2018

Recoverable Mutual Exclusion Under System-Wide Failures.

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Separating Lock-Freedom from Wait-Freedom.

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory.

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Detecting Malicious PowerShell Commands using Deep Neural Networks.

Proceedings of the 2018 on Asia Conference on Computer and Communications Security, 2018

2017

Recoverable Mutual Exclusion in Sub-logarithmic Time.

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Supervised Detection of Infected Machines Using Anti-virus Induced Labels - (Extended Abstract).

Proceedings of the Cyber Security Cryptography and Machine Learning, 2017

2016

Mellor-Crummey and Scott Mutual Exclusion Algorithm.

Encyclopedia of Algorithms, 2016

Lower Bounds for Restricted-Use Objects.

SIAM J. Comput., 2016

Lower Bound on the Step Complexity of Anonymous Binary Consensus.

Proceedings of the Distributed Computing - 30th International Symposium, 2016

On the Complexity of Reader-Writer Locks: Extended Abstract.

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Node-centric detection of overlapping communities in social networks.

Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015

Fast and space-efficient shapelets-based time-series classification.

Intell. Data Anal., 2015

Local-shapelets for fast classification of spectrographic measurements.

Expert Syst. Appl., 2015

The Price of being Adaptive.

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Trading Fences with RMRs and Separating Memory Models.

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Nontrivial and Universal Helping for Wait-Free Queues and Stacks.

Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Scheduling-Based Contention Management Techniques for Transactional Memory.

Proceedings of the Transactional Memory. Foundations, Algorithms, Tools, and Applications, 2015

Birds of a Feather Flock Together: The Accidental Communities of Spammers.

Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2014

Software-based contention management for efficient compare-and-swap operations.

Concurrency and Computation: Practice and Experience, 2014

Complexity tradeoffs for read and update operations.

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

2013

Exploiting Locality in Lease-Based Replicated Transactional Memory via Task Migration.

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Brief announcement: an asymmetric flat-combining based queue algorithm.

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract.

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Lightweight Contention Management for Efficient Compare-and-Swap Operations.

Proceedings of the Euro-Par 2013 Parallel Processing, 2013

Early Detection of Outgoing Spammers in Large-Scale Service Provider Networks.

Proceedings of the Detection of Intrusions and Malware, and Vulnerability Assessment, 2013

2012

On the Inherent Sequentiality of Concurrent Objects.

SIAM J. Comput., 2012

RMR-efficient implementations of comparison primitives using read and write operations.

Distributed Computing, 2012

Lower bounds for restricted-use objects: extended abstract.

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

2011

Non-Blocking Algorithms.

Proceedings of the Encyclopedia of Parallel Computing, 2011

Randomized mutual exclusion with sub-logarithmic RMR-complexity.

Distributed Computing, 2011

Metric Anomaly Detection via Asymmetric Risk Minimization.

Proceedings of the Similarity-Based Pattern Recognition - First International Workshop, 2011

Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated.

Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

A Dynamic Elimination-Combining Stack Algorithm.

Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

2010

Time and Space Lower Bounds for Implementations Using k-CAS.

IEEE Trans. Parallel Distrib. Syst., 2010

An O(1) RMRs Leader Election Algorithm.

SIAM J. Comput., 2010

Scalable Flat-Combining Based Synchronous Queues.

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Flat combining and the synchronization-parallelism tradeoff.

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Scheduling support for transactional memory contention management.

Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2010

Adaptive randomized mutual exclusion in sub-logarithmic expected time.

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects.

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

2009

Book review of synchronization algorithms and concurrent programming by Gadi Taubenfeld (Pearson/Prentice Hall, 2006).

SIGACT News, 2009

The complexity of obstruction-free implementations.

J. ACM, 2009

Bounded-wait combining: constructing robust and high-throughput shared objects.

Distributed Computing, 2009

Randomized mutual exclusion in O(log N / log log N) RMRs.

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

On the Impact of Serializing Contention Management on STM Performance.

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

PEDS: A Parallel Error Detection Scheme for TCAM Devices.

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Layered Interval Codes for TCAM-Based Classification.

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008

Solo-valency and the cost of coordination.

Distributed Computing, 2008

Tight rmr lower bounds for mutual exclusion and other problems.

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Layered interval codes for tcam-based classification.

Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2008

CAR-STM: scheduling-based collision avoidance and resolution for software transactional memory.

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Tight RMR lower bounds for mutual exclusion and other problems.

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

A Robust and Knot-Aware Trust-Based Reputation Model.

Proceedings of the Trust Management II, 2008

2007

Constant-RMR implementations of CAS and other synchronization primitives using read and write operations.

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Space-Efficient TCAM-Based Classification Using Gray Coding.

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006

A dynamic-sized nonblocking work stealing deque.

Distributed Computing, 2006

On the inherent weakness of conditional primitives.

Distributed Computing, 2006

Constructing Shared Objects That Are Both Robust and High-Throughput.

Proceedings of the Distributed Computing, 20th International Symposium, 2006

An

*O*(1) RMRs leader election algorithm.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Synchronizing without locks is inherently expensive.

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

2005

Time and Space Lower Bounds for Implementations Using

*k*-CAS.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Linear Lower Bounds on Real-World Implementations of Concurrent Objects.

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

Dynamic Memory ABP Work-Stealing.

Proceedings of the Distributed Computing, 18th International Conference, 2004

A scalable lock-free stack algorithm.

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

On the inherent weakness of conditional synchronization primitives.

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003

Operation-valency and the cost of coordination.

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

2002

Work dealing.

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Non-blocking steal-half work queues.

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

1995

On the Comnplexity of Global Computation in the Presence of Link Failures: The General Case.

Distributed Computing, 1995

1993

On the Complexity of Global Computation in the Presence of Link Failures: The General Case.

Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993