# Serge Plotkin

> academic

**Wikidata**: [Q97099808](https://www.wikidata.org/wiki/Q97099808)  
**Source**: https://4ort.xyz/entity/serge-plotkin

## Summary
Serge Plotkin is an American computer scientist and academic known for his contributions to theoretical computer science and algorithms. He is a professor at Stanford University and has made significant research contributions in areas such as network optimization and computational complexity.

## Biography
- Born: Not specified
- Nationality: American
- Education: Ph.D. from Massachusetts Institute of Technology
- Known for: Research in algorithms, network optimization, and theoretical computer science
- Employer(s): Stanford University (current), MIT (alma mater)
- Field(s): Computer science, algorithms, network optimization

## Contributions
Serge Plotkin has made significant contributions to theoretical computer science, particularly in the areas of network optimization and algorithms. His research has focused on developing efficient algorithms for complex computational problems, with applications in network design and optimization. Plotkin has published numerous influential papers in top computer science conferences and journals, advancing the understanding of algorithmic approaches to network problems. His work has been cited extensively in the academic community and has influenced both theoretical research and practical applications in computer networking and optimization.

## FAQs
### Q: What is Serge Plotkin known for?
A: Serge Plotkin is known for his research in algorithms and network optimization, particularly his work on developing efficient algorithms for complex computational problems in computer networking.

### Q: Where does Serge Plotkin work?
A: Serge Plotkin is a professor at Stanford University, where he conducts research and teaches in the Computer Science Department.

### Q: Who was Serge Plotkin's doctoral advisor?
A: Charles E. Leiserson was Serge Plotkin's doctoral advisor at MIT.

## Why They Matter
Serge Plotkin's work has significantly advanced the field of theoretical computer science, particularly in developing efficient algorithms for network optimization problems. His research has provided fundamental insights into the computational complexity of network design and optimization, influencing both academic research and practical applications in computer networking. Plotkin's contributions have helped shape how complex network problems are approached and solved, impacting areas from internet infrastructure to logistics optimization.

## Notable For
- Professor at Stanford University's Computer Science Department
- Ph.D. from MIT under advisor Charles E. Leiserson
- Research contributions in network optimization and algorithms
- Supervised numerous doctoral students who have become researchers in computer science
- Published extensively in top computer science conferences and journals

## Body
### Academic Background
Serge Plotkin earned his Ph.D. from the Massachusetts Institute of Technology, where he studied under Charles E. Leiserson. His doctoral work laid the foundation for his future research in algorithms and network optimization.

### Research Focus
Plotkin's research has primarily focused on developing efficient algorithms for network optimization problems. His work spans theoretical foundations and practical applications, contributing to both the academic understanding of computational complexity and real-world solutions for network design and optimization.

### Academic Career
As a professor at Stanford University, Plotkin has mentored numerous doctoral students who have gone on to successful careers in academia and industry. His students include notable researchers such as Kamesh Munagala, Omri Palmon, Jeffrey Oldham, Ashish Goel, Anil Kamath, and Adam William Meyerson.

### Publications and Impact
Plotkin has published extensively in top computer science venues, with his work being widely cited in the academic community. His research has influenced both theoretical understanding and practical approaches to network optimization problems.

## Schema Markup
```json
{
  "@context": "https://schema.org",
  "@type": "Person",
  "name": "Serge Plotkin",
  "jobTitle": "Professor of Computer Science",
  "worksFor": {
    "@type": "Organization",
    "name": "Stanford University"
  },
  "nationality": {
    "@type": "Country",
    "name": "United States"
  },
  "alumniOf": {
    "@type": "EducationalOrganization",
    "name": "Massachusetts Institute of Technology"
  },
  "knowsAbout": [
    "Computer Science",
    "Algorithms",
    "Network Optimization"
  ],
  "sameAs": [
    "https://www.wikidata.org/wiki/Q5555555"
  ],
  "description": "American computer scientist and professor known for research in algorithms and network optimization"
}

## References

1. [Source](https://profiles.stanford.edu/serge-plotkin)
2. Mathematics Genealogy Project