Collaborators

Papers and preprints

1. Aaron D. Jaggard and Joseph J. Marincel, "Generating-tree isomorphisms for pattern-avoiding involutions," accepted for publication in Annals of Combinatorics. [Submitted version (14 pages, 01 December 2007)]
2. Aaron D. Jaggard, "An almost-bijective proof of an asymptotic property of partitions," Random Structures & Algorithms, 31 (2), 2007, pp. 247--250. doi:10.1002/rsa.20180
3. Aaron D. Jaggard, "Subsequence containment by involutions," Electronic Journal of Combinatorics 12 (1), 2005 #R14, 15 pages.
4. Aaron D. Jaggard, "Prefix exchanging and pattern avoidance by involutions," Electronic Journal of Combinatorics 9 (2), 2003 #R16, 24 pages.

Combinatorics Links

• Combinatorics papers from the math arXiv.
• The On-Line Encyclopedia of Integer Sequences
• The Electronic Journal of Combinatorics
• Séminaire Lotharingien de Combinatoire
• The list of home pages of combinatorial people at the Elec. J. Comb.
• The Budapest Semesters in Mathematics homepage. (Not really research related, but my semester there was my introduction to combinatorics.)

Collaborators

Papers and Technical Reports

1. Syeda Arzoo Zehra, Aaron D. Jaggard, and Rebecca N. Wright, "On Safe Route Redistribution: Improving the Sufficient Condition"
   • Short version submitted
   • DIMACS Technical Report 2009-17 in preparation
2. Bruno Blanchet, Aaron D. Jaggard, Jesse Rao, Andre Scedrov, and Joe-Kai Tsay, "Refining Computationally Sound Mechanized Proofs for Kerberos"
   • Abstract to be presented at FCC'09
3. Joan Feigenbaum, Aaron D. Jaggard, and Michael Schapira, "Approximate Privacy: Foundations and Quantification"
   • Conference version submitted.
   • DIMACS Technical Report 2009-14 [Version of 2009-05-16: abstract, 24-page pdf].
4. Aaron D. Jaggard, Vijay Ramachandran, and Rebecca N. Wright, "The Impact of Communication Models on Routing-Algorithm Convergence"
   • To appear in the Proceedings of ICDCS 2009 (June 2009).
   • DIMACS Technical Report 2008-06 [Version of 2008-11-24: abstract, 29-page pdf]]
5. Sharon Goldberg, Shai Halevi, Aaron D. Jaggard, Vijay Ramachandran, and Rebecca N. Wright, "Rationality and Traffic Attraction: Incentives for Honest Path Announcements in BGP"
   • Proceedings of SIGCOMM 2008, pp. 267--278 (2008). doi:10.1145/1402946.1402989, [12-page pdf]
   • Princeton CS Technical Report TR-823-08.
6. Aaron D. Jaggard, Cathy Meadows, Michael Mislove, and Roberto Segala, "Task Probabilistic Input/Ouput Automata as Domains",
   • Presented at FCC'08
   • Collection of all FCC'08 abstracts (16-page PDF)
7. B. Blanchet, A. D. Jaggard, A. Scedrov, and J.-K. Tsay, "Computationally Sound Mechanized Proofs for Basic and Public-key Kerberos,"
   • Proceedings of ASIACCS 2008, pp. 87--99 (2008). doi:10.1145/1368310.1368326
   This extends the work presented in:
   • Aaron D. Jaggard, Andre Scedrov, and Joe-Kai Tsay, "Computationally Sound Mechanized Proof of PKINIT for Kerberos,"
     • Presented at FCC'07. [PDF]
8. Aaron D. Jaggard, Vijay Ramachandran, and Rebecca N. Wright, "Towards a Realistic Model of Incentives in Interdomain Routing: Decoupling Forwarding from Signaling"
   • DIMACS Technical Report 2008-02 [Version of 2008-04-27: abstract, 37-page pdf]
9. I. Cervesato, A. D. Jaggard, A. Scedrov, J.-K. Tsay, and C. Walstad, "Breaking and Fixing Public-Key Kerberos,"
   • Information and Computation 206, pp. 402--424 (2008). doi:10.1016/j.ic.2007.05.005
   • This work is related to Microsoft Security Bulletin MS05-042.
   This extends preliminary work presented in:
   • I. Cervesato, A. D. Jaggard, A. Scedrov, J.-K. Tsay, and C. Walstad, "Breaking and Fixing Public-Key Kerberos,"
     • Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues, LNCS 4435, pp. 167-181. doi:10.1007/978-3-540-77505-8_13
   • I. Cervesato, A. D. Jaggard, A. Scedrov, J.-K. Tsay, and C. Walstad, "Breaking and Fixing Public-Key Kerberos,"
     • Sixth Workshop on Issues in the Theory of Security - WITS'06 (Dieter Gollmann and Jan Juerjens, editors), pp. 55-70, Vienna, Austria, 25-26 March 2006.
10. Aaron D. Jaggard and Vijay Ramachandran, "Robust Path-Vector Routing Despite Inconsistent Route Preferences"
    • Proceedings of IEEE ICNP 2006 (Santa Barbara, USA, November 2006)
    • (Extended preliminary version) Yale CS Technical Report 1314 [.pdf]
11. M. Backes, I. Cervesato, A. D. Jaggard, A. Scedrov, J.-K. Tsay, "Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos,"
    • ESORICS 2006
    • Expanded version on Cryptology ePrint Archive: Report 2006/219
12. Aaron D. Jaggard and Vijay Ramachandran, "Towards the Design of Robust Inter-domain Routing Protocols," IEEE Network 19 (6), 35-41 (2005).
    
    • Preliminary version [.pdf]
13. Aaron D. Jaggard and Vijay Ramachandran, "Relating Two Formal Models of Path-Vector Routing,"
    
    • Proceedings of IEEE INFOCOM 2005 (Miami, USA, March 2005) [.pdf] [.ps]
    • (Extended version) Yale CS Technical Report 1301 (in preparation)
14. Aaron D. Jaggard and Vijay Ramachandran, "Robustness of Class-Based Path-Vector Systems,"
    
    • Proceedings of ICNP 2004 (Berlin, Germany, October 2004) [.pdf] [.ps]
    • (Extended version) Yale CS Technical Report 1296 (in preparation)
15. Timothy G. Griffin, Aaron D. Jaggard, and Vijay Ramachandran, "Design Principles of Policy Languages for Path Vector Protocols,"
    
    • Proceedings of SIGCOMM 2003 (.pdf) (Karlsruhe, Germany, August 2003)
    • (Extended version) Yale CS Technical Report 1250 (26 pages, April 2004) [.pdf] [.ps]
16. F. Butler, I. Cervesato, A. D. Jaggard, A. Scedrov, and C. Walstad, "Formal Analysis of Kerberos 5,"
    
    • Theoretical Computer Science 367, pp. 57--87 (2006) doi:10.1016/j.tcs.2006.08.040
    This extends preliminary work presented in:
    • Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, and Chris Walstad, "Specifying Kerberos 5 Cross-Realm Authentication,"
      • Proceedings of WITS 05 (Long Beach, USA, January 2005).[PDF]
    • Fred Butler, Iliano Cervesato, Aaron D. Jaggard, and Andre Scedrov, "A Formal Analysis of Some Properties of Kerberos 5 using MSR"
      • UPenn CIS Technical Report MS-CIS-04-04 (59 pages, April 2004).
        [PDF] [PS]
    • Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, and Andre Scedrov, "Verifying Confidentiality and Authentication in Kerberos 5,"
      • In Software Security - Theories and Systems --- ISSS 2003, Springer-Verlag LNCS 3233, K. Futatsugi, F. Mizoguchi, and N. Yonezaki, eds. [PDF] [GZipped PS]
    • Fred Butler, Iliano Cervesato, Aaron D. Jaggard, and Andre Scedrov, "A formal analysis of some properties of Kerberos 5 using MSR,"
      • 15th IEEE Computer Security Foundations Workshop, 2002
      • Preliminary version: [PDF] [PS] [GZipped PS]

Links

• The National Science Foundation
• The Office of Naval Research

Papers

1. D. L. Jaggard and A. D. Jaggard, "Fractal Ring Arrays," Wave Motion (Special Issue: Electrodynamics in Complex Environments). 34 281-299 (2001).
2. A. D. Jaggard and D. L. Jaggard, "Cantor Ring Diffractals," Optics Comm. 158, 141-148 (1998).
3. D. L. Jaggard and A. D. Jaggard, "Cantor Ring Arrays," Microwave and Optical Technology Letters 19, 121-125 (1998).
4. A. D. Jaggard and D. L. Jaggard, "Scattering from Fractal Superlattices with Variable Lacunarity," J. Opt. Soc. Am. A 15, 1626-1635 (1998)
5. D. L. Jaggard and A. D. Jaggard, "Polyadic Cantor Superlattices with Variable Lacunarity," Opt. Lett. 22, 145-147 (1997)

Book Chapters

1. Dwight L. Jaggard, Aaron D. Jaggard, and Panayiotis V. Frangos, "Fractal Electrodynamics: Surfaces and Superlattices," Chapter 1 (pages 1-47) in Frontiers in Electromagnetics, Douglas H. Werner and Raj Mittra, eds., IEEE Press (2000)
2. Douglas H. Werner, Pingjuan L. Werner, Dwight L. Jaggard, Aaron D. Jaggard, Carles Puente, and Randy L. Haupt "The Theory and Design of Fractal Antenna Arrays," Chapter 3 (pages 94-203) in Frontiers in Electromagnetics, Douglas H. Werner and Raj Mittra, eds., IEEE Press (2000)

Wednesday, June 17, 2009 at 23:01