485 search results - page 28 / 97 » Iterative Bounding LAO |
CORR
2006
Springer
15 years 18 days ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
131
click to vote
CSFW
2012
IEEE
13 years 3 months ago
2012
IEEE
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
114
click to vote
UAI
2003
15 years 1 months ago
2003
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
157
Voted
STOC
2007
ACM
16 years 26 days ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
CSR
2010
Springer
15 years 5 months ago
2010
Springer
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...