Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Orponen, Pekka - Department of Information and Computer Science, Helsinki University of Technology
Distributed Algorithms for Lifetime Maximization in Sensor Networks via Min-Max
Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search
0 ' $ " ) ( 1 2 ( " ' 3 4 5 ) 5 6 7 ) 8 9 ( 1 @ ! 9 ) % 4 A B C C D E C @ ! 9 ) % 6 A ) ! $ ) F
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
&'()01 (201345 6789@9A9B CD ECFGA9BH IP@B7PBQ RPSTBFU CD IP@B7PB8 CD 9VB EWBPV XBGAY`@PQ
% & ' ( ) 0 1 2 3 ( 45 5 6 % 5 0 0 & 7 ( 8 3 6 5 6 9
Optimisation, block designs and No Free Lunch theorems
Focused Local Search for Random 3-Satisfiability Sakari Seitz
Exact and Approximate Balanced Data Gathering in
Metrika manuscript No. (will be inserted by the editor)
Local Clustering of Large Graphs by Approximate Fiedler Vectors [Extended Abstract]
Balanced Multipath Source Routing Shreyas Prasad, Andre Schumacher , Harri Haanpaa, and Pekka Orponen
Synthesizing Minimal Tile Sets for Patterned DNA Self-Assembly
On Approximation Preserving Reductions: Complete Problems and Robust Measures
Efficient Algorithms for Sampling and Clustering of Large Nonuniform Networks
Multicast Time Maximization in Energy Constrained Wireless Networks
Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability
Load Balancing by Distributed Optimisation in Ad Hoc Networks
Locally computable approximations for spectral clustering and absorption times of random walks
arXiv:0711.4902v1[cs.DS]30Nov2007 CIRCUMSPECT DESCENT PREVAILS IN SOLVING
Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-Assembly