University of Cincinnati
Department of ECE and Computer Science
Cincinnati Ohio, 45221-0030

Picture Here

Kenneth Berman

Office:	...891 Rhodes (ML 0030)
Phone:	...(513)-556-5205
FAX:	...(513)-556-7326
Email:	... ken.berman@uc.edu
Book:	...Book Information

Biography

Dr. Berman is currently a Professor of Computer Science and Engineering in the ECECS Department in the College of Engineering at U.C. He received his Ph.D. in Combinatorics and Optimization from the University of Waterloo, Canada in 1979, under the supervision of the famous mathematician W.T. Tutte. In 1980 and 1981 he held a NATO Postdoctoral Fellowship at the University of Cambridge, England and M.I.T., respectively. He was an Assistant Professor of Mathematics and Computer Science at Wesleyan University for four years and a Professor of Computer Science in the College of Arts and Science at U.C. for eleven years. Dr. Berman's research areas include Networks and Applied Graph Theory, Algorithms, Internet Technologies, Parallel and Distributed Computing, Knowledge Management. He is Co-Director of the Laboratory for Networks and Applied Graph Theory and the Center for Internet Studies and Knowledge Management . He is also Coordinator of the department research group Internet Computing and Information Science. Dr. Berman has over fifty publication and has co-authored a book with Jerry Paul on sequential and parallel algorithms. Dr. Berman has received multiple grants from the National Science Foundation, the National Security Agency, the Ohio Board of Regents and the U.S. Department of Transportation.

Research Interests

Dr. Berman's research areas include Dr. Berman's research areas include Networks and Applied Graph Theory, Algorithms, Internet Technologies, Parallel and Distributed Computing, Knowledge Management.

Funding

Dr. Berman has received research grants from the the National Science Foundation, the National Security Agency, the Ohio Board of Regents and the U.S. Department of Transportation.

Description of Current Funding

Research Laboratory

Please come and visit the homepage of the Laboratory for Networks and Applied Graph Theory.

Selected Recent Publications

1. Kenneth A. Berman and Chad Yoshikawa, Locally-Fair Flows and Online Client-Server Load Balancing, submitted to SODA 2009. PDF version

2. Kenneth A. Berman, Fred S. Annexstein and Aravind Ranganathan, Dominating Connectivity and Reliability of Heterogeneous Sensor Networks, Proceedings of IEEE PerCom 2006, FAWN workshop. PDF version, PP slides

3. Kenneth A. Berman and Fred .S. Annexstein: Actualizing Context for Personal Knowledge Management, submitted for publication in ACM SIGMOD Record. Postscript version.

4. K.A. Berman and F.S. Annexstein: An Educational Tool for the 21st Century:Peer-to-peer computing, Ohio Learning Network Conference, Windows on the Future Conference, Powerpoint Presentation , PDF version

5. Kenneth A. Berman, Cost-Constrained Matchings and Disjoint Paths, Submitted for publication in Discrete Applied Math., 2003. PDF version.

6. Kenneth A. Berman, Cost-Constrained Edge-Disjoint Spanning Trees, in preparation.

7. Kenneth A. Berman, Cost-Constrained Solutions to Graph and Matroid Problems via Algebraic Encoding, in preparation.

Kenneth.A. Berman and Fred S. Annexstein (2002): Actualizing Context and Personal Information Management, Technical Report 2002, submitted to ACM Transactions on Computer-Human Interaction. Postscript version.
Kenneth A. Berman and Jerry Paul, Verifiable broadcasting and gossiping in communication networks, Discrete Applied Math., 118 (2002) 293-298.
Fred .S. Annexstein and Kenneth A. Berman and M. Jovanovic: Latency Effects on Reachability in Large-scale Peer-to-Peer Networks . Appears in SPAA 2001, Thirteenth ACM Symposium on Parallel Algorithms and Architectures. Postscript version, Power Point slides.
Fred. S. Annexstein and Kenneth. A. Berman, M. Jovanovic, and K. Ponnavaikko: Indexing Techniques for File Sharing in Scalable Peer-to-Peer Networks. Appears in Proceedings IEEE ICCCN 2002, 11th International Conference on Computer Communications and Networks, Miami. PDF version.
Fred S. Annexstein and Kenneth .A. Berman (2000): Directional routing via generalized st-numberings. SIAM J Discrete Math., 13: (2) 268-279. PDF version.
Fred .S. Annexstein , Kenneth A. Berman, Tsan-sheng Hsu, and Ram Swaminathan (2000): A multi-tree generating routing scheme using acyclic orientations. Theoretical Computer Science, 240: (2) 487-494. PDF version.
Kenneth A. Berman and Xin Liu, Cycles through large degree vertices in digraphs, A generalization of Meyniel's theorem, to be published in J. Combinatorial Theory, Series B.
Kenneth A. Berman and Yanpei Liu, Generalized Bicycles, Discrete Applied Math., 78 (1997), 27-40.
Fred S. Annexstein and Kenneth A. Berman, Approximation algorithms for optimal depth independent trees and st-numberings, 4th International Colloquium on Structural Information and Communication Complexity (SIROCCO '97), Switzerland, Carleton University Press.
Kenneth A. Berman, Vulnerability of scheduled networks and a generalization of Menger's theorem, Networks, 28 (1996), 125-134.
Kenneth A. Berman and Yanpei Liu, Bicycles, matchings, and trees, Journal of Northern Jioatong University, Special Bicentennial Issue, 20 (1996), 694-702.
Kenneth A. Berman, John Franco and John Schlipf, Unique satisfiability for Horn sets can be solved in nearly linear time, Discrete Applied Math., 60 (1995), 77-91.
Kenneth A. Berman, John Schlipf and John Franco, Computing the well-founded semantics faster, Springer Notes in Computer Science, Logic programming and Non-Monitonic Reasoning, V. Marek, A. Nerode, & Truszczynski, eds., 1995 (J. Schlipf and J. Franco)