Design of algorithm studies methods and techniques used to develop efficient algorithms. The design of efficient algorithms is often a critical first step in solving problems in many areas. Depending on the model of computation or computer platform that is required for an application, one might draw on algorithmic research in specific subareas. Several CSE faculty members are involved in algorithmic research.
- Graph Algorithms (He, Ngo)
The research on graph algorithms has been a driving force in the field of design and analysis of algorithms. Many
practical application problems can be modeled by graph problems. With recent developments in computer science
(such as the Internet and networking), many new problems arise and create new research opportunities.
- Parallel Algorithms and Architectures (Miller)
Since the computational power of a single processor is limited, large-scale
problems require multiprocessor machines. The study of parallel algorithms
and architectures is concerned with the design and implementation of
efficient techniques and strategies to solve problems on machines in
which multiple processors are connected.
- Graph Drawing (He)
Graph drawing deals with the problem of constructing two- and three-dimensional visualizations of graphs. A good
visualization of a graph has several important properties, such as few edge-crossings, small area, good aspect-ratio,
and few edge-bends. It has applications in practical areas such as Computer Graphics, VLSI design, Computer Animation
etc. This field focuses on developing efficient algorithms for constructing good visualizations of graphs.
It uses techniques in Graph algorithm and Computational Geometry.
- Computational Geometry (Miller, Xu)
Computational geometry is a discipline concerned with the design, analysis, and implementation of efficient algorithms
for solving problems best described as a set geometric objects such as points, curves, surfaces, and polyhedra. Since
many real world problems can be modeled as geometric objects in certain metric spaces (such as Euclidean spaces),
this area has strong connection with many applied areas such as Medicine, Biology, Networking, Graphics, Robotics,
and VLSI design. Exploiting geometric and combinatorial properties of these problems often leads to better quality
and more efficient solutions.
- Group Testing Algorithms (Ngo)
Group testing dates back to World War II. Algorithms are derived to identify
a set of ďpositivesĒ in a large population of given items, assuming
some mechanism exists that indicates if a pool of items has at least one positive.
Direct applications of group testing algorithms include DNA-library screening,
multiple access control, and mining association rules. Fundamental problems
in group testing relate to mathematical disciplines like combinatorics, extremal
set theory and algebra, making research on group testing very fruitful.
Complexity theory is a mathematical discipline that classifies computational
problems by relative difficulty and measures the computational resources
needed to solve them. It explains why certain problems have no practical
solutions and helps researchers anticipate the difficulties involved in
solving problems of certain types. The classification is quantitative
and investigates both the resources that are necessary to solve a problem
called lower bounds for the problem and the resources currently known
to be sufficient called upper bounds. In general, complexity theory deals
with the quantitative laws of computation and reasoning. For this reason,
complexity theory concerns issues and problems of direct interest to many
other disciplines as well.
Alan Selmanís research is
concerned with properties of complexity classes, with relationships between
classes, and with identification of properties of problems that affect
their computational complexity. He has focused on several areas:
- Average case complexity, which provides mechanisms for classification
of computational problems according to average use of resources, rather
than worst-case usage
- Complexity theoretic underpinnings of public-key cryptography,
including research on promise problems and complexity of classes of partial
- Polynomial-time-bounded reducibilities
- P-selective sets, which are an important tool for studying reducibilities
and function classes
- Self-reducibility, which tends to lower complexity
Ken Reganís research focuses
on the obstacles to proving non-trivial lower bounds in complexity theory.
Motivated by the fact that virtually no super-linear, let alone super-polynomial,
time lower bounds are known for practical problems, part of Reganís
work has developed the less-attended theory of linear-time classes. Regan
has obtained super-linear lower bounds on time or circuit-size for some
problems under certain restrictions. Currently, Regan is pursuing a mathematical
approach to breaking barriers to proving super-polynomial lower bounds.
Reganís work includes:
- Linear time computation and super-linear lower bounds
- Polynomial ideals and algebraic geometry as tools for lower bounds
- Mathematical logic for analyzing provability and characterizing complexity classes
- Complexity-bounded measure theory
- Fixed-parameter complexity theory
CSE Demo Day
CSE students gather in the Davis Atrium to demonstrate their semesterly capstone projects and current research projects.
CSE End of the Year Awards Reception
We will be holding our End of the Year Awards Reception on December 16th at the Center for Tomorrow. All are welcome to attend! Please RSVP.
Industrial Career Day
Industry Representatives will be making presentations and providing table displays. Food will be available at each session, and you will receive a free t-shirt for attending!
Alumni Student Reception
Meet with current students, alumni, board members and company representatives. Come network, learn about our cutting edge research and outstanding academic programs, and meet our world-class faculty.
Silicon Valley Alumni Reception
Were you in Mountain View, CA on September 27th?
Have a look at the photos of our alumni event!
President Tripathi stops by to welcome our Fall 2016 incoming computer science grad students!
Save the Date
CSE's 50th anniversary gala celebration will be September 28—October 1, 2017. Will you help us plan it? Let us know which events you'd like to attend by taking this short survey.
Tech Savvy 11
CSE ran a workshop at AAUW's Tech Savvy 11. Pictured (l-r) are Sada Haider, Lakshmi Ethiraj, Dr. Carl Alphonce, Aishani Bhalla, and Julia Cordani (not pictured: S. Doddi, W. Shi, M. Arnold, V. Kaplinsky, and R. Roberts).
This necklace 'hears' what you eat
Assistant Professor Wenyao Xu and his research partners at China's Northeastern University are developing Autodietary, a high-tech, food-tracking necklace. Read the full press release here.
Dr. Koutsonikolas wins NSF CAREER Award
Assistant Professor Dimitrios Koutsonikolas won the NSF CAREER Award for his "CAREER: A Millimeter-Wave Multi-Layer WLAN Architecture for Multi-Gigabit, Always-On Connectivity".
Dr. Gao wins NSF CAREER Award
Assistant Professor Jing Gao won the NSF CAREER Award for her proposal titled, "CAREER: Mining Reliable Information from Crowdsourced Data". The award is expected to total over $500K.
2015 SEAS Faculty Award Winners (CSE)
CSE faculty win awards at the 2015 SEAS Faculty Awards ceremony. Above: Qiao, Alphonce, Rudra, Ko. Below: Xu, Ren, Upadhyaya, Koutsonikolas, Gao.
2015 SEAS Faculty Award Winners (CSE)
Another shot of CSE faculty award winners at the 2015 SEAS Faculty Awards ceremony. Wu, Koutsonikolas, Xu, Ren, Upadhyaya, Rudra, Ko, Alphonce, Gao.
Dr. Qiao Begins Term as CSE Chair
CSE announces Chunming Qiao's appointment as CSE department chair in our 2015-2016 promotional postcard.
International acclaim for Dr. Govindaraju
UB Interim VP for Research and SUNY Distinguished Professor Venu Govindaraju receives international career honor for his research contributions.
UB Interim VP for Research and SUNY Distinguished Professor Venu Govindaraju socializes with some of the 60 alums who attended the inaugural meeting of the UB Engineering Chapter of the Bay Area, UBay, in Palo Alto, CA.
Tech Savvy 10
CSE students ran a workshop at AAUW's Tech Savvy 10. Pictured (l-r) are Savannah Towey, Meg Arnold, Sanjee Choudhery, Dr. Carl Alphonce, Bich Vu, and Christina Nowak (not pictured: Allison Palum).
Thanks to Vans Warped Tour
Prof. Mike Buckley would like to thank Kevin Lyman, Kate Truscott, and the entire Vans Warped Tour 2014 for their generous donation to The Center for Socially Relevant Computing. More »
Catching Chess Cheaters
CSE associate professor, theoretician and International Master chessplayer Kenneth W. Regan is the subject of a technical and biographical profile in the June 2014 issue of Chess Life.
Students competed 'round the clock in UB Hacking 2014 over the weekend of April 5-6. Winners, projects, prizes, and sponsors are announced here.
Tech Savvy 9
CSE students presented a session at UB's Tech Savvy 9. Pictured are Victoria Minorczyk, Bich Vu, Dr. Alphonce, Kayla Weixlmann, Christine Baxter, Amie Vuong (l-r).
Congratulations, Dr. Ko!
CSE Assistant Professor Steve Ko won the prestigious NSF CAREER Award for his research program titled, 'Systems for Transparency in Personal Devices and Services'.
Congratulations, Dr. Qiao!
Chunming Qiao receives 2013 SUNY Chancellor's Award for Excellence in Scholarship and Creative Activities. Dr. Qiao is joined onstage by President Satish Tripathi, Provost Charles Zukoski, and SEAS Dean Liesl Folks.
UBHacking 2013 Winners
GamePute won first prize in a field of 30 teams at UBHacking 2013. Joe Peacock and Nick DiRienzo pose with GamePute team Scott Florentino, Andrew Wantuch, Jen Cordaro, and Andrew Kopanon.
CSE students win SEAS Grad Student Poster Competition
Ankur Upadhyay, Daniel Bellinger, and Sumit Agarwal's work on Laasie won first prize in the 2013 SEAS Grad Poster Competition. They are advised by Luke Ziarek and Oliver Kennedy.
CSE undergrads demonstrate technology from the Center for Socially Relevant Computing (CSRC) to newly-accepted students and their parents at the CSE Open House on Saturday, March 23.
Student Research Poster Session
CSE graduate students and their faculty advisors present research posters in the Davis Atrium on March 7, 2013.
CSE and Management students compete in the Northeast Collegiate Cyberdefense Competition (NCCC) on Saturday, January 19. UB advanced to the next round of competition, to be held at the University of Maine in March.
UB's Center of Excellence in Information Systems, Assurance, Research, and Education (CEISARE) received a $1.6 million NSF grant to train students to protect the United States from cyberattacks. »
Geoffrey Challen and Steven Ko are enlisting hundreds of students to build an unprecedented smartphone network to help scientists improve mobile computers and better understand how they're changing the world. »
Davis Hall dedication
UB hosted Davis Hall's ribbon-cutting ceremony on May 12, 2012. Pictured (l to r) are: Kamlesh Tripathi, Margaret Jacobs, Jeremy Jacobs, Barbara Davis, Jack Davis, Rajan Batta, George Maziarz, and Harvey Stenger.
Davis Hall southwest elevation
Davis Hall, CSE's new $75M headquarters, is designed to meet LEED "Gold" standards. The building is named for Barbara and Jack Davis. Davis is the founder of Akron-based I Squared R Element Co.
Exposing chess cheats
Theoretician and International Master chessplayer Kenneth W. Regan devises algorithms to detect chess cheating. The New York Times recently profiled his work .
Nobel Laureate Herbert Hauptman, a CSE affiliated professor, developed an algorithm for determining crystal structure. Computing in Science and Engineering Magazine named it one of the top 10 algorithms of the 20th century.
Pursuing work on document verification and identification, CSE researchers use machine-learning algorithms to study handwriting variability.
CSE professor Russ Miller is one of the authors of a program that can determine the structure of molecules as large as 2,000 atoms from X-ray diffraction patterns.
CSE professor Aidong Zhang is developing intelligent content-analysis programs to automatically analyze images, replacing human coding of semantic content.
Davis Hall northwest elevation
This concept scheme shows Davis Hall, CSE's new $75M headquarters, viewed from the northwest. The edge of Ketter Hall is visible on the right, just east of Davis. UB held the ribbon-cutting ceremony on May 12, 2012.
A geometric algorithm developed by CSE professor Jinhui Xu configures a set of radiation beams to destroy brain tumors in a form of computer-aided surgery.
The CSE faculty includes NSF CAREER award holders; ACM, IEEE, and AAAI fellows; and editors of noteworthy journals.
CSE faculty work with researchers in chemistry, the life sciences, the pharmaceutical sciences, media study, geography, and many other disciplines.
Davis Hall northeast elevation
This concept scheme shows Davis Hall, CSE's new $75M headquarters, viewed from the northeast. Ketter and Furnas Halls can be seen on the left, just south of the new building. We broke ground in April 2009.
CEDAR, a CSE-affiliated research center, developed the systems that postal agencies around the world use to automatically sort hand-addressed mail.
CSE's MultiStore Research Group is funded by a $1 million NSF grant for the development of high-performance online data-storage systems.
Cutting-edge research facilities
CSE faculty are major participants in the new $200 million Buffalo Center of Excellence in Bioinformatics.
Grants for research
CSE faculty average some $4.5 million annually in research grants. Our research areas range from high-performance computing to data mining.
Click on the calendar image to view the schedule of planned events.
See a list of current and past events.