Sciweavers

1201 search results - page 6 / 241
» Linear Probing and Graphs
Sort
View
ET
2010
89views more  ET 2010»
13 years 8 months ago
On the Duality of Probing and Fault Attacks
In this work we investigate the problem of simultaneous privacy and integrity protection in cryptographic circuits. We consider a white-box scenario with a powerful, yet limited at...
Berndt M. Gammel, Stefan Mangard
IPL
2007
130views more  IPL 2007»
13 years 9 months ago
Linear structure of bipartite permutation graphs and the longest path problem
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
Ryuhei Uehara, Gabriel Valiente
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 years 10 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
COMBINATORICA
2008
104views more  COMBINATORICA 2008»
13 years 10 months ago
Linearity of grid minors in treewidth with applications through bidimensionality
We prove that any H-minor-free graph, for a fixed graph H, of treewidth w has an (w)
Erik D. Demaine, MohammadTaghi Hajiaghayi
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
13 years 11 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner