Research Areas
The Computer Science department at Rutgers-Camden has a vibrant research program that is particularly strong in the theoretical areas of CS. While the core strength of the department is in theory, current faculty research is driven by applications in many different areas of CS. The following provides a broad overview of the areas in which our faculty conduct research. More specific information can be found on individual webpages.
Algorithms: Gandhi, Kortsarz, Shende
Approximation algorithms, Randomized algorithms, Online algorithms, Combinatorial optimization.
Complexity Theory: Birget, Kortsarz
Connections between computational complexity and combinatorial group theory, Lower bounds.
Computational Geometry: Gandhi, Ramaswami
Geometric algorithms and applications, Surface/volume modeling, Geometry and computational statistics, Mesh generation.
Cryptography and Computer Security: Birget, Hong
Secure multi-party communication, Graphical passwords.
Networks: Gandhi, Hong, Palis, Shende
Wireless networks, Sensor networks, Optical networks, Frequency assignment in cellular networks, Resource management and scheduling, Analysis of large-scale networks, Metabolic networks in biological sciences.
Parallel and Distributed Computing: Palis, Shende
Task scheduling in scalable parallel computers, High-performance distributed objects programming environment, Parallel programming environments.
Programming Languages: Johann
Automated deduction, functional programming, computational logic.