Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Micah Adler"'
Publikováno v:
IEEE/ACM Transactions on Networking. 21:69-83
Neighbor discovery is an important first step in the initialization of a wireless ad hoc network. In this paper, we design and analyze several algorithms for neighbor discovery in wireless networks. Starting with a single-hop wireless network of n no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5cb5fdad7c8d8f8ff254c2dc2fdb3b4e
https://doi.org/10.1109/tnet.2012.2189892
https://doi.org/10.1109/tnet.2012.2189892
Publikováno v:
Computer Networks. 55:4007-4020
Content Delivery Networks (CDNs) deliver web content to end-users from a large distributed platform of web servers hosted in data centers belonging to thousands of Internet Service Providers (ISPs) around the world. The bandwidth cost incurred by a C
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db2341ac1a7acd2c8792cc93174d597a
https://doi.org/10.1016/j.comnet.2011.07.015
https://doi.org/10.1016/j.comnet.2011.07.015
Autor:
Brent Heeringa, Micah Adler
Publikováno v:
Algorithmica. 62:1112-1121
We give a (ln n+1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T=(T 1,…,T m ) and a set of n items X=(X 1,…,X n ). The goal is to output a binary tree where each internal node is a test, each lea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c00f7257699fa04966e9134c512c437
https://doi.org/10.1007/s00453-011-9510-9
https://doi.org/10.1007/s00453-011-9510-9
Publikováno v:
ACM Transactions on Information and System Security. 11:1-34
Using analysis, simulation, and experimentation, we examine the threat against anonymous communications posed by passive-logging attacks. In previous work, we analyzed the success of such attacks under various assumptions. Here, we evaluate the effec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28d0fb6b336d28e3b420bb9c6c68502a
https://doi.org/10.1145/1330332.1330335
https://doi.org/10.1145/1330332.1330335
Publikováno v:
Theory of Computing Systems. 42:465-487
It is proved that “FIFO” worksharing protocols provide asymptotically optimal solutions to two problems related to sharing large collections of independent tasks in a heterogeneous network of workstations (HNOW) $\mathcal{N}$. In the $\mathsf{HNO
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19982f11d84014c47d533a928e1d7d2e
https://doi.org/10.1007/s00224-007-9001-1
https://doi.org/10.1007/s00224-007-9001-1
Autor:
Dan Rubenstein, Micah Adler
Publikováno v:
ACM Transactions on Algorithms. 1:48-73
The problem of designing efficient algorithms for sharing the cost of multicasting has recently received considerable attention. In this article, we examine the effect on the complexity of pricing when two flexibility-enhancing mechanisms are incorpo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4edeb23eb9d738f1f9c510346bc2a998
https://doi.org/10.1145/1077464.1077469
https://doi.org/10.1145/1077464.1077469
Autor:
Adi Rosén, Micah Adler
Publikováno v:
Journal of Algorithms. 55:101-112
A growing amount of work has been invested in recent years in analyzing packet-switching networks under worst-case scenarios rather than under probabilistic assumption. Most of this work makes use of the model of "adversarial queuing theory" proposed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::628774817f99d817b04a837fcf0744cd
https://doi.org/10.1016/j.jalgor.2004.04.013
https://doi.org/10.1016/j.jalgor.2004.04.013
Autor:
Micah Adler
Publikováno v:
Journal of the ACM. 52:217-244
There has been considerable recent interest in probabilistic packet marking schemes for the problem of tracing a sequence of network packets back to an anonymous source. An important consideration for such schemes is the number of packet header bits
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1194bfcc9159c72c35c41aa6a8c24c5b
https://doi.org/10.1145/1059513.1059517
https://doi.org/10.1145/1059513.1059517
Publikováno v:
ACM Transactions on Information and System Security. 7:489-522
There have been a number of protocols proposed for anonymous network communication. In this paper, we investigate attacks by corrupt group members that degrade the anonymity of each protocol over time. We prove that when a particular initiator contin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e464fe443bc89041cd1f1d351a952e0
https://doi.org/10.1145/1042031.1042032
https://doi.org/10.1145/1042031.1042032
Autor:
Neil Immerman, Micah Adler
Publikováno v:
LICS
We introduce a new Ehrenfeucht--Fraïssé game for proving lower bounds on the size of first-order formulas. Up until now, such games have only been used to prove bounds on the operator depth of formulas, not their size. We use this game to prove tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b0fdc6eb8c8c3aee529045d8423f1818
https://doi.org/10.1145/772062.772064
https://doi.org/10.1145/772062.772064