Fred S. Annexstein

A Traveling Salesperson Tour of 30 Ohio Cities (1033 miles)

Phone:	...(513)-556-1807
FAX:	...(513)-556-7326
Email:	... fred.annexstein (at) uc.edu
Address:	... 889 Rhodes Hall
	... Department of Computer Science
	... College of Engineering
	... University of Cincinnati
	... Cincinnati, Ohio 45221

Advisor CS Class 2012 :
Here is the current curriculum list
Spring 2008 Office Hours 12-2 Tu-Th Rhodes 889

Spring 2008 Schedule

Office Hours: Tu-Th 12:00-2:00

Class Number

Course Title

Days

Start Time

End Time

Location

20 CS 728

INTERNET STUDIES & WEB ALGORITHMS

Tu Th

2:00

3:15 PM

Riev 616D

Click here for Homepages of Courses Previously Taught

Communication Networks, Social Networks, Collaborative Internet technologies, Algorithms for parallel and distributed processing, Peer-to-peer networks, Routing in networks, Parallel algorithms and architectures, Interconnection networks, Information Retrieval, Discrete algorithms, Applied graph theory, Computational biology.

Recent Publications

F. Annexstein, Topic-based Segmentation Using Preference Data, Technical Report 2007, submitted for publication. TR07
M.T. Helmick and F.S. Annexstein, Depth-Latency Tradeoffs in Multicast Tree Algorithms, Proceedings of IEEE 21st International Conference on Advanced Information Networking and Applications (AINA-07)
F. Annexstein, K. Berman, S. Strunjus, C. Yoshikawa: Maximizing Throughput in Minimum Rounds in an Application Level Relay Service, SIAM/ACM Workshop on Algorithm Engineering and Experiments (ALENEX07)

4. K. Berman, F. Annexstein, and A. Ranganathan: Dominating Connectivity and Reliability of Heterogeneous Sensor Networks, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06), 2006, pp. 91-95. PDF, PPT slides

5. F.S. Annexstein and K.A. Berman: Directional routing via generalized st-numberings. SIAM J DISCRETE MATH 13: (2) 268-279 APR 7 2000 PDF

Svetlana Strunjaš-Yoshikawa, Fred Annexstein, and Kenneth Berman: Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet, 32nd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM06, 2006, Czech Republic, Powerpoint, PDF
F.S. Annexstein and K.A. Berman and M. Jovanovic: Broadcasting in Unstructured Peer-to-Peer Overlay Networks, Theoretical Computer Science, Special Issue on Complex Networks, April 2006, PDF

1. F.S. Annexstein and K.A. Berman and M. Jovanovic: Latency Effects on Reachability in Large-scale Peer-to-Peer Networks . Appears in Proceedings SPAA 2001, Thirteenth ACM Symposium on Parallel Algorithms and Architectures - Postscript version and Powerpoint Presentation

2. F.S. Annexstein and K.A. Berman, M. Jovanovic, and Kovendhan Ponnavaikko: Indexing Techniques for File Sharing in Scalable Peer-to-Peer Networks. Appears in Proceedings IEEE ICCCN 2002, The 11th International Conference on Computer Communications and Networks - PDF version

3. F.S. Annexstein and R.P. Swaminathan: On testing consecutive-ones property in parallel. Discrete Applied Mathematics 88: (1-3) pp. 7-28 NOV 9 1998. Second Special Issue on Computational Molecular Biology, guest-edited by S. Istrail, P. Pevzner and R. Shamir; a preliminary version appears in Proceedings of 7th ACM Symposium on Parallel Architectures and Algorithms. PDF

4. F.S. Annexstein, Ken Berman, Tsan-sheng Hsu, and Ram Swaminathan: A multi-tree generating routing scheme using acyclic orientations. Theoretical Computer Science, 240: (2) 487-494 JUN 17 2000.

Full Publications Listing

Groups and Projects

The MyBooks/MyPeers Project Page -
The MyBooks/MyPeers project focuses on theoretical and practical methods for the effective organization, presentation, and collaboration over information collections in the context of peer communities.

Laboratory for Networks and Applied Graph Theory.

Theory of Computing Laboratory.

Biography

Dr. Fred Annexstein is an Associate Professor of Computer Science in the Department of Electrical & Computer Engineering at the University of Cincinnati, and he has been on the faculty since 1990. He received a Ph.D. in Computer Science from University of Massachusetts-Amherst in 1991, and a Master’s degree in Mathematics from the State University of New York-Binghamton in 1985. He received a B.S. in Mathematics from SUNY-Binghamton in 1983. His current investigations focus on 1) developing algorithms to exploit connection redundancy in peer-to-peer and sensor networks for enhanced networking efficiency and reliability, 2) applying structural decomposition and encoding schemes to manage and exploit information carried in large web data repositories and taxonomies, 3) developing hashing and load balancing assignment methods for collaborative or volunteer computational systems. He has published over 15 journal articles in the areas of algorithms and computer networking, and has received several recent grants for research support and instrumentation from NSF. His full vita is available on request from fred.annexstein (at) uc.edu