| Publication | Date of Publication | Type |
|---|
Bounds and algorithms for alphabetic codes and binary search trees
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Efficient and reliable post-quantum authentication
Theoretical Computer Science | 2024-06-04 | Paper |
On reconfigurability of VLSI linear arrays
Lecture Notes in Computer Science | 2023-01-18 | Paper |
| Probabilistic secret sharing | 2021-08-04 | Paper |
Secret sharing schemes for infinite sets of participants: a new design technique
Theoretical Computer Science | 2021-02-15 | Paper |
Performing tasks on synchronous restartable message-passing processors
Distributed Computing | 2020-12-03 | Paper |
Routing selfish unsplittable traffic
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Time-optimal message-efficient work performance in the presence of faults
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
| scientific article; zbMATH DE number 6741942 (Why is no real title available?) | 2017-07-11 | Paper |
| scientific article; zbMATH DE number 6741945 (Why is no real title available?) | 2017-07-11 | Paper |
Secure computation without computers
Theoretical Computer Science | 2017-03-16 | Paper |
Private visual share-homomorphic computation and randomness reduction in visual cryptography
Lecture Notes in Computer Science | 2017-01-06 | Paper |
Measure-independent characterization of contrast optimal visual cryptography schemes
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Secure two-party computation: a visual way
Lecture Notes in Computer Science | 2015-09-30 | Paper |
On k -set consensus problems in asynchronous systems
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing | 2015-09-11 | Paper |
Color visual cryptography schemes for black and white secret images
Theoretical Computer Science | 2014-01-13 | Paper |
Using colors to improve visual cryptography for black and white images
Lecture Notes in Computer Science | 2011-05-19 | Paper |
On designing truthful mechanisms for online scheduling
Theoretical Computer Science | 2009-08-21 | Paper |
Colored visual cryptography without color darkening
Theoretical Computer Science | 2009-06-22 | Paper |
New Constructions of Mechanisms with Verification
Automata, Languages and Programming | 2009-03-12 | Paper |
The power of verification for one-parameter agents
Journal of Computer and System Sciences | 2009-03-02 | Paper |
Cheating Immune (2,n)-Threshold Visual Secret Sharing
Lecture Notes in Computer Science | 2008-11-27 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Security in Communication Networks
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Optimal colored threshold visual cryptography schemes
Designs, Codes and Cryptography | 2005-08-17 | Paper |
On the Data Expansion of the Huffman Compression Algorithm
The Computer Journal | 2000-03-19 | Paper |
On lower bounds for the redundancy of optimal codes
Designs, Codes and Cryptography | 1999-06-27 | Paper |
A new bound for the data expansion of Huffman codes
IEEE Transactions on Information Theory | 1999-05-05 | Paper |
Testing and reconfiguration of VLSI linear arrays
Theoretical Computer Science | 1998-08-13 | Paper |
On the redundancy achieved by Huffman codes
Information Sciences | 1997-09-04 | Paper |
Catastrophic faults in reconfigurable systolic linear arrays
Discrete Applied Mathematics | 1997-08-10 | Paper |
Minimal path length of trees with known fringe
Theoretical Computer Science | 1997-02-28 | Paper |
Characteristic inequalities for binary trees
Information Processing Letters | 1997-02-28 | Paper |
A note on the expected path length of trees with known fringe
Information Processing Letters | 1997-02-27 | Paper |
New lower bounds on the cost of binary search trees
Theoretical Computer Science | 1997-02-27 | Paper |
New bounds on the expected length of one-to-one codes
IEEE Transactions on Information Theory | 1996-12-01 | Paper |
On binary search trees
Information Processing Letters | 1993-06-29 | Paper |
