Publications
(2009).
(2007).
(1994).
A Phenomenon in the Theory of Sorting.
Journal of Computer and System Sciences. 6(2), 103-115.
(1972).
(2008). Pathlet Routing.
111-122.
(2009). Pathlet Routing.
97-102.
(2008). On the Price of Heterogeneity in Parallel Systems.
Theory of Computing Systems. 45(2), 280-301.
(2009). Parallelizing Connectionist Networks for Pattern Recognition: A Library Approach.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 98).
(1998). Pktd: A Packet Capture and Injection Daemon.
Proceedings of Passive and Active Measurement Workshop (PAM-2003). 87-96.
(2003).
(2012). Pattern Matching for Arc-Annotated Sequences.
Journal of Algorithms.
(2004). Parameterized Intractability of Distinguishing Substring Selection.
Theory of Computing Systems.
(2004). A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns.
Proceedings of the Fourth International Workshop on Algorithms in Bioinformatics (WABI 2004).
(2004). Perfect Path Phylogeny Haplotyping with Missing Data is Fixed-Parameter Tractable.
Proceedings of the First International Workshop on Parameterized and Exact Computation (IWPEC 2004).
(2004).
(2008). Perfect Phylogeny and Haplotype Assignment.
Proceedings of RECOMB.
(2004). Polylogarithmic Inapproximability.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC).
(2003).
(1997).
(1989).
(1989). The Price is (Not) Right: Comparing Privacy in Free and Paid Apps.
2020(3), 222-242.
(2020). PREDATOR: Proactive Recognition and Elimination of Domain Abuse at Time-Of-Registration.
Proceedings of ACM CCS.
(2016). A Public Option for the Core.
SIGCOMM '20: Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication. 377-39.
(2020).
(1992).