Micah Adler

According to our database1, Micah Adler authored at least 73 papers between 1994 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2013
Efficient Algorithms for Neighbor Discovery in Wireless Networks.
IEEE/ACM Trans. Netw., 2013

2012
Approximating Optimal Binary Decision Trees.
Algorithmica, 2012

2011
Algorithms for optimizing the bandwidth cost of content delivery.
Computer Networks, 2011

2008
Passive-Logging Attacks Against Anonymous Communications Systems.
ACM Trans. Inf. Syst. Secur., 2008

On "Exploiting" Node-Heterogeneous Clusters Optimally.
Theory Comput. Syst., 2008

Search Space Reductions for Nearest-Neighbor Queries.
Proceedings of the Theory and Applications of Models of Computation, 2008

Approximating Optimal Binary Decision Trees.
Proceedings of the Approximation, 2008

2006
On the capacity of information networks.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Lower bounds for asymmetric communication channels and distributed source coding.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

On optimal communication cost for gathering correlated data through wireless sensor networks.
Proceedings of the 12th Annual International Conference on Mobile Computing and Networking, 2006

Algorithms for Optimizing Bandwidth Costs on the Internet.
Proceedings of the 1st IEEE Workshop on Hot Topics in Web Systems and Technologies, 2006

2005
Pricing multicasting in more flexible network models.
ACM Trans. Algorithms, 2005

Tight bounds for the performance of Longest In System on DAGs.
J. Algorithms, 2005

Trade-offs in probabilistic packet marking for IP traceback.
J. ACM, 2005

Towards asymptotic optimality in probabilistic packet marking.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Collecting correlated information from a sensor network.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Minimum energy reliable paths using unreliable wireless links.
Proceedings of the 6th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2005

Optimal peer selection for P2P downloading and streaming.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Efficient Probabilistic Packet Marking.
Proceedings of the 13th IEEE International Conference on Network Protocols (ICNP 2005), 2005

2004
Optimal proxy cache allocation for efficient streaming media distribution.
IEEE Trans. Multimedia, 2004

The predecessor attack: An analysis of a threat to anonymous communications systems.
ACM Trans. Inf. Syst. Secur., 2004

Two optimal peer selection problems.
SIGMETRICS Performance Evaluation Review, 2004

Optimal Website Design with the Constrained Subtree Selection Problem.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous Processors.
Proceedings of the Algorithms, 2004

2003
An n! lower bound on formula size.
ACM Trans. Comput. Log., 2003

Randomized Pursuit-Evasion In Graphs.
Combinatorics, Probability & Computing, 2003

Time-Constrained Scheduling of Weighted Packets on Trees and Meshes.
Algorithmica, 2003

A stochastic process on the hypercube with applications to peer-to-peer networks.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Optimal sharing of bags of tasks in heterogeneous clusters.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

A proportionate fair scheduling rule with good worst-case performance.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Defending Anonymous Communications Against Passive Logging Attack.
Proceedings of the 2003 IEEE Symposium on Security and Privacy (S&P 2003), 2003

Estimation of Congestion Price Using Probabilistic Packet Marking.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

Using multicast for streaming videos across wide area networks.
Proceedings of the Global Telecommunications Conference, 2003

Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?".
Proceedings of the Proceedings 36th Annual Simulation Symposium (ANSS-36 2003), Orlando, Florida, USA, March 30, 2003

2002
Scheduling Time-Constrained Communication in Linear Networks.
Theory Comput. Syst., 2002

Tradeoffs in probabilistic packet marking for IP traceback.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Tight Bounds for the Performance of Longest-in-System on DAGs.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Pricing multicasting in more practical network models.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

An Analysis of the Degradation of Anonymous Protocols.
Proceedings of the Network and Distributed System Security Symposium, 2002

Optimal Proxy Cache Allocation for Efficient Streaming Media Distribution.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

Randomized Pursuit-Evasion in Graphs.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
Protocols for Asymmetric Communication Channels.
J. Comput. Syst. Sci., 2001

Compression Using Efficient Multicasting.
J. Comput. Syst. Sci., 2001

New Protocols for Asymmetric Communication Channels.
Proceedings of the SIROCCO 8, 2001

Deadline Fair Scheduling: Bridging the Theory and Practice of Proportionate Fair Scheduling in Multiprocessor Systems.
Proceedings of the 7th IEEE Real-Time Technology and Applications Symposium (RTAS 2001), 30 May, 2001

Tree Layout for Internal Network Characterizations in Multicast Networks.
Proceedings of the Networked Group Communication, 2001

An n! Lower Bound on Formula Size.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

Channelization Problem in Large Scale Data Dissemination.
Proceedings of the 9th International Conference on Network Protocols (ICNP 2001), 2001

Towards Compressing Web Graphs.
Proceedings of the Data Compression Conference, 2001

2000
Parallel Sorting with Limited Bandwidth.
SIAM J. Comput., 2000

Efficient Communication Strategies for Ad Hoc Wireless Networks.
Theory Comput. Syst., 2000

Compression using efficient multicasting.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors.
Proceedings of the 4th Symposium on Operating System Design and Implementation (OSDI 2000), 2000

Tight Size Bounds for Packet Headers in Narrow Meshes.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
Modeling Parallel Bandwidth: Local versus Global Restrictions.
Algorithmica, 1999

Time-Constrained Scheduling of Weighted Packets on Trees and Meshes.
SPAA, 1999

The Complexity of End-to-End Communication in Memoryless Networks.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998
Parallel randomized load balancing.
Random Struct. Algorithms, 1998

Asynchronous Shared Memory Search Structures.
Theory Comput. Syst., 1998

Scheduling Time-Constrained Communication in Linear Networks.
SPAA, 1998

Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).
SPAA, 1998

Communication-Optimal Parallel Minimum Spanning Tree Algorithms (Extended Abstract).
SPAA, 1998

Protocols for Asymmetric Communication Channels.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

Analyzing an Infinite Parallel Job Allocation Process.
Proceedings of the Algorithms, 1998

1997
Modeling Parallel Bandwidth: Local vs. Global Restrictions.
SPAA, 1997

A Modular Analysis of Network Transmission Protocols.
Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997

1996
Asynchronous Shared Memory Search Structures.
SPAA, 1996

New Coding Techniques for Improved Bandwidth Utilization.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995
Parallel randomized load balancing (Preliminary Version).
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Parallel Sorting with Limited Bandwidth.
SPAA, 1995

Scheduling Parallel Communication: The h-relation Problem.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994
AT2 Bounds for a Class of VLSI Problems and String Matching.
SPAA, 1994

Selection in the Presence of Noise: The Design of Playoff Systems.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994


  Loading...