Sciweavers

COCO
2004
Springer
78views Algorithms» more  COCO 2004»
14 years 4 months ago
Language Compression and Pseudorandom Generators
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
Harry Buhrman, Troy Lee, Dieter van Melkebeek
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 8 months ago
Optimally Reconstructing Weighted Graphs Using Queries
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
Hanna Mazzawi