4865 search results - page 509 / 973 » The Complexity of Graph Connectivity |
196
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—The split of a multihop, point to point TCP connection consists in replacing a plain, end-to-end TCP connection by a cascade of TCP connections. In such a cascade, conne...
162
click to vote
MFCS
2005
Springer
16 years 16 days ago
2005
Springer
Abstract. Effective fractal dimension was defined by Lutz (2003) in order to quantitatively analyze the structure of complexity classes. Interesting connections of effective dim...
190
click to vote
STACS
2005
Springer
16 years 15 days ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
198
click to vote
ICALP
2003
Springer
16 years 7 days ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
175
click to vote
ISCAS
1999
IEEE
15 years 11 months ago
1999
IEEE
A method for modeling complex CMOS gates by the reduction of each gate to an effective equivalent inverter is introduced. The conducting and parasitic behavior of parallel and ser...