-
3
-
-
70350426111
-
On the power of uniform power: Capacity of wireless networks with bounded resources
-
Fiat, A., Sanders, P. (eds.) ESA 2009. Springer, Heidelberg
-
Avin, C., Lotker, Z., Pignolet, Y.A.: On the power of uniform power: Capacity of wireless networks with bounded resources. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 373-384. Springer, Heidelberg (2009)
-
(2009)
LNCS
, vol.5757
, pp. 373-384
-
-
Avin, C.1
Lotker, Z.2
Pignolet, Y.A.3
-
4
-
-
0026902215
-
On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
-
Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences 45(1), 104-126 (1992)
-
(1992)
Journal of Computer and System Sciences
, vol.45
, Issue.1
, pp. 104-126
-
-
Bar-Yehuda, R.1
Goldreich, O.2
Itai, A.3
-
5
-
-
37849000224
-
Cross-layer latency minimization in wireless networks with SINR constraints
-
Chafekar, D., Anil Kumar, V.S., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Cross-layer latency minimization in wireless networks with SINR constraints. In: Proceedings of the 8thACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pp. 110-119 (2007)
-
(2007)
Proceedings of the 8thACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC)
, pp. 110-119
-
-
Chafekar, D.1
Anil Kumar, V.S.2
Marathe, M.V.3
Parthasarathy, S.4
Srinivasan, A.5
-
6
-
-
84923109933
-
On computing ad-hoc selective families
-
Clementi, A.E.F., Crescenzi, P., Monti, A., Penna, P., Silvestri, R.: On computing ad-hoc selective families. In: Proceedings of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-APPROX), pp. 211-222 (2001)
-
(2001)
Proceedings of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-APPROX)
, pp. 211-222
-
-
Clementi, A.E.F.1
Crescenzi, P.2
Monti, A.3
Penna, P.4
Silvestri, R.5
-
7
-
-
33244477826
-
Combination can be hard: Approximability of the unique coverage problem
-
Demaine, E.D., Hajiaghayi, M.T., Feige, U., Salavatipour, M.R.: Combination can be hard: approximability of the unique coverage problem. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 162-171 (2006)
-
(2006)
Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)
, pp. 162-171
-
-
Demaine, E.D.1
Hajiaghayi, M.T.2
Feige, U.3
Salavatipour, M.R.4
-
8
-
-
70350666356
-
Oblivious interference scheduling
-
Fanghänel, A., Kesselheim, T., Räcke, H., Vöcking, B.: Oblivious interference scheduling. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, pp. 220-229 (2009)
-
(2009)
Proceedings of the 28th ACM Symposium on Principles of Distributed Computing
, pp. 220-229
-
-
Fanghänel, A.1
Kesselheim, T.2
Räcke, H.3
Vöcking, B.4
-
9
-
-
70350417574
-
Improved algorithms for latency minimization in wireless networks
-
Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. Springer, Heidelberg
-
Fanghänel, A., Kesselheim, T., Vöcking, B.: Improved algorithms for latency minimization in wireless networks. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 447-458. Springer, Heidelberg (2009)
-
(2009)
LNCS
, vol.5556
, pp. 447-458
-
-
Fanghänel, A.1
Kesselheim, T.2
Vöcking, B.3
-
10
-
-
37849036026
-
Complexity in geometric SINR
-
Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in geometric SINR. In: Proceedings of the 8th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), New York, NY, USA, pp. 100-109 (2007)
-
(2007)
Proceedings of the 8th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), New York, NY, USA
, pp. 100-109
-
-
Goussevskaia, O.1
Oswald, Y.A.2
Wattenhofer, R.3
-
12
-
-
70350405162
-
Wireless scheduling with power control
-
Fiat, A., Sanders, P. (eds.) ESA 2009. Springer, Heidelberg
-
Halldórsson, M.M.: Wireless scheduling with power control. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 361-372. Springer, Heidelberg (2009)
-
(2009)
LNCS
, vol.5757
, pp. 361-372
-
-
Halldórsson, M.M.1
-
13
-
-
70350374314
-
Wireless communication is in APX
-
Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. Springer, Heidelberg
-
Halldórsson, M.M., Wattenhofer, R.: Wireless communication is in APX. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. Part I, LNCS, vol. 5555, pp. 525-536. Springer, Heidelberg (2009)
-
(2009)
LNCS
, vol.5555
, Issue.PART I
, pp. 525-536
-
-
Halldórsson, M.M.1
Wattenhofer, R.2
-
15
-
-
0001165620
-
Packet routing and job-shop scheduling in O(congestion+dilation) steps
-
Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job-shop scheduling in O(congestion+dilation) steps. Combinatorica (1994)
-
(1994)
Combinatorica
-
-
Leighton, F.T.1
Maggs, B.M.2
Rao, S.B.3
-
17
-
-
33748084040
-
Topology control meets SINR: The scheduling complexity of arbitrary topologies
-
Moscibroda, T., Wattenhofer, R., Zollinger, A.: Topology control meets SINR: The scheduling complexity of arbitrary topologies. In: Proceedings of the 7th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pp. 310-321 (2006)
-
(2006)
Proceedings of the 7th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC)
, pp. 310-321
-
-
Moscibroda, T.1
Wattenhofer, R.2
Zollinger, A.3
-
18
-
-
0002544335
-
Aloha packet system with and without slots and capture
-
Roberts, L.G.: Aloha packet system with and without slots and capture. SIGCOMM Comput. Commun. Rev. 5(2), 28-42 (1975)
-
(1975)
SIGCOMM Comput. Commun. Rev.
, vol.5
, Issue.2
, pp. 28-42
-
-
Roberts, L.G.1
|