Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
13214
search results - page 258 / 2643
»
Pseudorandomness for network algorithms
Sort
relevance
views
votes
recent
update
View
thumb
title
170
click to vote
DIALM
2007
ACM
92
views
Algorithms
»
more
DIALM 2007
»
Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks
15 years 10 months ago
Download
www.cdm.depaul.edu
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
claim paper
Read More »
136
click to vote
DIALM
2000
ACM
75
views
Algorithms
»
more
DIALM 2000
»
Energy-efficient randomized routing in radio networks
15 years 10 months ago
Download
www.cs.odu.edu
Koji Nakano, Stephan Olariu
claim paper
Read More »
119
click to vote
AAECC
1991
Springer
104
views
Algorithms
»
more
AAECC 1991
»
Algebraic Constructions of Efficient Broadcast Networks
15 years 10 months ago
Download
www.cs.auckland.ac.nz
Michael J. Dinneen, Michael R. Fellows, Vance Fabe...
claim paper
Read More »
125
click to vote
STOC
1987
ACM
46
views
Algorithms
»
more
STOC 1987
»
Size-Time Complexity of Boolean Networks for Prefix Computations
15 years 10 months ago
Download
www.cs.brown.edu
Gianfranco Bilardi, Franco P. Preparata
claim paper
Read More »
144
click to vote
DIALM
2005
ACM
81
views
Algorithms
»
more
DIALM 2005
»
Local approximation schemes for ad hoc and sensor networks
15 years 8 months ago
Download
research.microsoft.com
Fabian Kuhn, Tim Nieberg, Thomas Moscibroda, Roger...
claim paper
Read More »
« Prev
« First
page 258 / 2643
Last »
Next »