Sciweavers

2472 search results - page 208 / 495
» Parallel Key Exchange
Sort
View
PODC
2010
ACM
15 years 8 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
ENTCS
2006
141views more  ENTCS 2006»
15 years 6 months ago
Refining the Undecidability Border of Weak Bisimilarity
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
Mojmír Kretínský, Vojtech Reh...
JDA
2008
100views more  JDA 2008»
15 years 6 months ago
Efficient sampling of random permutations
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
Jens Gustedt
ICDE
2007
IEEE
127views Database» more  ICDE 2007»
16 years 7 months ago
Efficiently Detecting Inclusion Dependencies
Data sources for data integration often come with spurious schema definitions such as undefined foreign key constraints. Such metadata are important for querying the database and ...
Jana Bauckmann, Ulf Leser, Felix Naumann, Veroniqu...
CRYPTO
2009
Springer
144views Cryptology» more  CRYPTO 2009»
16 years 1 months ago
On the Composition of Public-Coin Zero-Knowledge Protocols
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...
Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikstr...