Sciweavers

928 search results - page 4 / 186
» The degree structure of Weihrauch-reducibility
Sort
View
CPC
1998
123views more  CPC 1998»
13 years 7 months ago
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Given a sequence of non-negative real numbers 0 1 ::: which sum to 1, we consider a random graph having approximately in vertices of degree i. In 12] the authors essentially show ...
Michael Molloy, Bruce A. Reed
EUROPAR
2004
Springer
14 years 1 months ago
Improving the Scalability of Logarithmic-Degree DHT-Based Peer-to-Peer Networks
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...
Bruno Carton, Valentin Mesaros
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 29 days ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
JOC
2011
81views more  JOC 2011»
13 years 2 months ago
An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in X and Y are low with respect to their genera. The fin...
Andreas Enge, Pierrick Gaudry, Emmanuel Thom&eacut...
JSYML
2010
73views more  JSYML 2010»
13 years 6 months ago
On Downey's conjecture
We prove that the degree structures of the d.c.e. and the 3-c.e. Turing degrees are not elementarily equivalent, thus refuting a conjecture of Downey. More specifically, we show t...
Marat M. Arslanov, Iskander Sh. Kalimullin, Steffe...