Dr. Fred S. Annexstein

Winter 2012 Teaching Schedule

CS 561,562,563- Senior Design W 4:00-5:30PM

CS 112- Programming Fundamentals
(see twitter.com/cs112class)

Office Hours: MWF 10:30-11:30 and by appointment

==============================

Previous Courses

Click here for Homepages of Courses Previously Taught

Faculty Office List

http://www.cs.uc.edu/~annexste/Courses

CS783: Combinatorial Generation
=====================================

Advisor CS Class 2012 :
Here is the current curriculum list

Name: Fred Annexstein

Phone: 513-556-1807

Fax: 513-556-7326

Dept of Computer Science

College of Engineering and Applied Sciences

University of Cincinnati

Cincinnati, OH 45221

My Blog: compuzzle
My Twitter: @proffreda

twitter.com/proffreda

Quote of the Day: Be polite to all, but intimate with few.

Thomas Jefferson

Research Interests:

Information 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.

Applie

Biography

Dr. Fred Annexstein is an Associate Professor of Computer Science in the College of Engineering at the University of Cincinnati, and he has been on the faculty at UC 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

LINKS

Applied Graph Theory and Networks Laboratory

•List of numbers and associated physical properties
•Internet Speed Tests
10MB Test
1MB Test
•Dictionary
•UC Library
•UC-Engineering Library
•Library resources in computer science and engineering.
•Programs and Dates of Conferences & Workshops
•Ohio Supercomputer Center
•Searc Lori's Kranium Blog
•Robin's Where'sWigan Blog
•Latest News on Waldorf Schools
•Coffee Shops of Clifton
•Lots of not-so random bits
•Python Programming Resources

Teaching Information

Recent Publications

1.F. Annexstein and K. Berman, Synthesis Ranking Using Critic Weights, Technical Report 11-11-2011, submitted to WWW2012. Link to paper.
2.F. Annexstein, Social Partitioning, submitted for publication, 2010
3.K. Berman and F. Annexstein, Progressive Load Balancing in Networks, submitted to journal, 2010.
4.F. Annexstein and Svetlana Strunjas, Collaborative Partitioning with Maximum User Satisfaction, CIKM,2008
2.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)
3. 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
6.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
7.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,
8.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
9.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
10.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
11.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.