# Eric Allender

> computer scientist

**Wikidata**: [Q5386010](https://www.wikidata.org/wiki/Q5386010)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Eric_Allender)  
**Source**: https://4ort.xyz/entity/eric-allender

## Summary
Eric Allender is an American computer scientist and engineer known for his contributions to computational complexity theory. He is a professor at Rutgers University and was named an ACM Fellow in 2007 for his work in the field.

## Biography
- Born: 1956
- Nationality: United States
- Education: Georgia Tech
- Known for: Contributions to computational complexity theory
- Employer(s): Rutgers University
- Field(s): Computer science, engineering

## Contributions
Eric Allender has made significant contributions to computational complexity theory through his research and academic work. As a professor at Rutgers University, he has supervised numerous doctoral students who have gone on to successful careers in computer science, including Michal Koucký, who earned his Ph.D. from Rutgers in 2003. Allender's work has been recognized by the Association for Computing Machinery, which named him an ACM Fellow in 2007 for his contributions to the field. His research has been published and cited extensively, with his work indexed in major academic databases including MathSciNet (MR Author ID: 24955) and zbMATH (Author ID: allender.eric-w). Allender maintains an active presence in the academic community through his Google Scholar profile and contributions to the ACM Digital Library.

## FAQs
### Q: What is Eric Allender known for?
A: Eric Allender is known for his contributions to computational complexity theory and his work as a computer science professor at Rutgers University.

### Q: Where did Eric Allender receive his education?
A: Eric Allender was educated at Georgia Tech.

### Q: What awards has Eric Allender received?
A: Eric Allender was named an ACM Fellow in 2007 and an ACM Distinguished Member in 2006 for his contributions to computing.

## Why They Matter
Eric Allender's work in computational complexity theory has helped advance our understanding of fundamental problems in computer science. His research has influenced how we approach and analyze computational problems, particularly in understanding the inherent difficulty of various computational tasks. Through his role as an educator at Rutgers University, Allender has shaped the next generation of computer scientists, with his doctoral students going on to make their own contributions to the field. His recognition as an ACM Fellow underscores the significance of his work to the broader computing community. Allender's contributions continue to be referenced and built upon in ongoing research in theoretical computer science.

## Notable For
- Named ACM Fellow in 2007 for contributions to computational complexity theory
- Supervised multiple successful doctoral students including Michal Koucký
- Maintains Erdős number of 2, indicating close connections to the mathematical research community
- Active researcher with publications indexed in major academic databases
- Distinguished Member of the Association for Computing Machinery

## Body
### Academic Career
Eric Allender has built his career as a professor at Rutgers University, where he has supervised numerous doctoral students. His academic lineage can be traced through the Mathematics Genealogy Project (ID: 6192), connecting him to a broader academic family tree.

### Research Impact
Allender's research in computational complexity theory has been widely recognized and cited. His work is indexed in major academic databases including MathSciNet (MR Author ID: 24955) and zbMATH (Author ID: allender.eric-w). He maintains an active Google Scholar profile (ID: dQwv9e4AAAAJ) where his publications continue to be accessed and referenced by researchers worldwide.

### Professional Recognition
The Association for Computing Machinery has recognized Allender's contributions in multiple ways. He was named an ACM Fellow in 2007, with the award specifically citing his contributions to computational complexity theory. He also received the ACM Distinguished Member award in 2006. These honors reflect both the quality and impact of his research work.

### Academic Lineage
Allender's own academic advisor was Kimberly King, as recorded in the Mathematics Genealogy Project. He has in turn mentored numerous doctoral students at Rutgers University, creating a legacy of academic mentorship. His students include notable researchers such as Michal Koucký, who completed his Ph.D. in 2003 and has gone on to an academic career of his own.

## References

1. [Source](https://www.acm.org/media-center/2007/january/acm-names-41-fellows-for-contributions-to-computing-and-it)
2. [Source](https://awards.acm.org/distinguished-members/award-winners)
3. Mathematics Genealogy Project