10988 search results - page 257 / 2198 » Algorithmic Folding Complexity |
170
click to vote
STOC
2000
ACM
15 years 7 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
137
click to vote
SAS
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
160
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
169
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
120
click to vote
DAC
2009
ACM
16 years 5 months ago
2009
ACM
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...