| Publication | Date of Publication | Type |
|---|
An \(O(n^2)\) algorithm for computing optimal continuous voltage schedules
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Tighter approximation bounds for minimum CDS in unit disk graphs
Algorithmica | 2011-12-14 | Paper |
Tighter approximation bounds for minimum CDS in wireless ad hoc networks
Algorithms and Computation | 2009-12-17 | Paper |
ON THE LONGEST RNG EDGE OF WIRELESS AD HOC NETWORKS
Discrete Mathematics, Algorithms and Applications | 2009-06-23 | Paper |
On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs
Journal of Combinatorial Optimization | 2009-05-04 | Paper |
A note on the feasibility of generalised universal composability
Mathematical Structures in Computer Science | 2009-03-24 | Paper |
Approximately optimal trees for group key management with batch updates
Theoretical Computer Science | 2009-03-20 | Paper |
A note on universal composable zero-knowledge in the common reference string model
Theoretical Computer Science | 2009-03-20 | Paper |
Algorithms for Minimum m-Connected k-Dominating Set Problem
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
Design and Analysis of Password-Based Key Derivation Functions
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Lower bounds and new constructions on secure group communication schemes
Theoretical Computer Science | 2008-11-18 | Paper |
Optimizing deletion cost for secure multicast key management
Theoretical Computer Science | 2008-07-31 | Paper |
Optimal Tree Structures for Group Key Management with Batch Updates
SIAM Journal on Discrete Mathematics | 2008-05-22 | Paper |
\(k\)-nearest-neighbor clustering and percolation theory
Algorithmica | 2007-11-28 | Paper |
Approximately Optimal Trees for Group Key Management with Batch Updates
Lecture Notes in Computer Science | 2007-11-13 | Paper |
A Note on the Feasibility of Generalized Universal Composability
Lecture Notes in Computer Science | 2007-11-13 | Paper |
A Note on Universal Composable Zero Knowledge in Common Reference String Model
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
Theoretical Computer Science | 2007-09-03 | Paper |
Min-energy voltage allocation for tree-structured tasks
Journal of Combinatorial Optimization | 2007-06-21 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
SIAM Journal on Computing | 2006-06-01 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Topics in Cryptology – CT-RSA 2005
Lecture Notes in Computer Science | 2005-12-08 | Paper |
| scientific article; zbMATH DE number 1306870 (Why is no real title available?) | 2000-04-26 | Paper |
Dictionary Look-Up with One Error
Journal of Algorithms | 1998-06-01 | Paper |
Approximating Shortest Superstrings
SIAM Journal on Computing | 1997-05-26 | Paper |
| scientific article; zbMATH DE number 176773 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 4213489 (Why is no real title available?) | 1991-01-01 | Paper |
THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION
International Journal of Computational Geometry & Applications | 1991-01-01 | Paper |
A Whirlwind Tour of Computational Geometry
The American Mathematical Monthly | 1990-01-01 | Paper |
Computing Euclidean maximum spanning trees
Algorithmica | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 3811281 (Why is no real title available?) | 1982-01-01 | Paper |
