Sciweavers

214
Voted
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
15 years 7 months ago
Two for One: Tight Approximation of 2D Bin Packing
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
STOC
2009
ACM
364views Algorithms» more  STOC 2009»
16 years 1 months ago
Distributed (delta+1)-coloring in linear (in delta) time
Leonid Barenboim, Michael Elkin
197
Voted
ASIAN
2009
Springer
363views Algorithms» more  ASIAN 2009»
15 years 1 months ago
A Logic for Formal Verification of Quantum Programs
Abstract. This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quant...
Yoshihiko Kakutani
ESA
2009
Springer
346views Algorithms» more  ESA 2009»
15 years 7 months ago
Hash, Displace, and Compress
A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m − 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ...
Djamal Belazzougui, Fabiano C. Botelho, Martin Die...
142
Voted
ASIAN
2009
Springer
334views Algorithms» more  ASIAN 2009»
15 years 1 months ago
A Dolev-Yao Model for Zero Knowledge
In cryptographic protocols, zero knowledge proofs are employed for a principal A to communicate some non-trivial information t to B while at the same time ensuring that B cannot de...
Anguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh
Algorithms
Top of PageReset Settings