Sciweavers

5451 search results - page 165 / 1091
» On very high degrees
Sort
View
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 10 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
15 years 8 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
237
Voted
FSE
2011
Springer
264views Cryptology» more  FSE 2011»
14 years 10 months ago
An Improved Algebraic Attack on Hamsi-256
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...
Itai Dinur, Adi Shamir
ESM
2000
15 years 8 months ago
Zero-overhead Pr/T-Net execution
Petri Nets and higher order versions like Predicate Transition Nets (Pr/T-Nets) are very suitable for modeling event-oriented discrete and even parallel systems. Obviously, the ne...
Carsten Böke, Markus Hübel, Franz J. Ram...
WWW
2008
ACM
16 years 7 months ago
Statistical analysis of the social network and discussion threads in slashdot
We analyze the social network emerging from the user comment activity on the website Slashdot. The network presents common features of traditional social networks such as a giant ...
Andreas Kaltenbrunner, Vicenç Gómez,...