Faculty

Institution

Unit

Venue

Serge Plotkin

Associate Professor of Computer Science Emeritus

Stanford University

Affiliations

School of Engineering

Computer Science

Serge Plotkin is currently serving as a Computer Science Associate Professor of Computer Science Emeritus at Stanford University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Serge Plotkin

Stanford University

Associate Professor of Computer Science Emeritus

You can click a keyword to filter the displayed items

applied mathematics computer science graph theory combinatorial optimization mathematical optimization computational optimization discrete algorithms systems engineering network routing algorithm discrete optimization network optimization machine learning theoretical computer science electrical engineering network analysis network science mathematical programming network routing transportation engineering computational complexity parallel computing numerical algorithms algorithm design routing protocols admission control approximation algorithms graph algorithms combinatorial problems distributed systems route planning approximation methods network planning network algorithms information processing (psychology) analysis of algorithms online algorithms machine scheduling network decomposition competitive routing fast approximation algorithms general topology networks unknown duration max-flow min-cut ratio vehicular technology control optimization parallel programming networked system design information management wireless routing probabilistic graph theory randomized algorithms integer optimization graph minors algorithm engineering higher dimensional problems quadratic programming oriented matroids parallel processing peer relationships incremental learning advanced networking parallel complexity theory linear programming load balancing (computing) k-cover algorithms energy efficient monitoring on-line routing throughput-competitive on-line routing distributed computation multicommodity flow excluded minors virtual circuit routing computer engineering fair resource allocation

Notable Scholarly Works

Notable Federal Grants

Collaborators

Combinatorial Optimization for Sensor Networks. (2006)

Serge PlotkinZoe Abrams

network sciencecombinatorial optimizationapplied mathematics

Time-Lapse Snapshots. Springer eBooks (2006)

Cynthia DworkMaurice HerlihySerge A. PlotkinOrli Waarts

systems engineeringcomputer visiontime-lapse snapshots

A Non-Manipulable Trust System Based on Eigentrust. ACM SIGecom Exchanges (2005)

Zoë AbramsRobert McGrewSerge Plotkin

non-manipulable trust systemtrustbehavioral sciences

Approximate Majorization and Fair Online Load Balancing. ACM Transactions on Algorithms (2005)

Ashish GoelAdam MeyersonSerge Plotkin

approximate majorizationcomputer sciencemachine learningload balancing (computing)online algorithmsapplied mathematics

A K-Median Algorithm With Running Time Independent of Data Size. Machine Learning (2004)

Adam MeyersonLiadan O'CallaghanSerge Plotkin

k-median algorithmdata sizemachine learningrunning timeapplied mathematics

An Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control. Journal of Algorithms (2004)

Ashish GoelMonika R. HenzingerSerge Plotkin

network routing algorithmmulticast routingcommunicationonline algorithmstransportation engineeringonline throughput-competitive algorithmadmission controlalgorithm design

Keeping Peers Honest in Eigentrust. (2004)

Zoë AbramsRobert McGrewSerge Plotkin

peer relationshipsbehavioral sciencestrustcommunication

Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks. (2004)

Zoë AbramsAshish GoelSerge Plotkin

systems engineeringmachine learningenergy efficient monitoringk-cover algorithms

Scheduling Data Transfers in a Network and the Set Scheduling Problem. Journal of Algorithms (2003)

Ashish GoelMonika R. HenzingerSerge PlotkinEva Tardos

network sciencenetwork analysiscomputer sciencenetwork optimizationcombinatorial optimizationdata transfersnetworked system designscheduling (computing)network planningdistributed systemsscheduling problemsoperations researchset scheduling problem

Approximating a Finite Metric by a Small Number of Tree Metrics. (2002)

M. CharikarC. ChekuriA. GoelS. GuhaS. Plotkin

finite metricsapproximation algorithmscomputer sciencecomputational complexitycombinatorial optimizationprobabilistic graph theorytree metricsgraph algorithmsgraph theoryrandomized algorithmscomputational optimizationnetwork algorithmsapplied mathematicsmathematical optimizationdiscrete algorithms

1
2
3
4
5
6
10 / page

Serge Plotkin

Associate Professor of Computer Science Emeritus

Stanford University

Affiliations

School of Engineering

Computer Science

Serge Plotkin is currently serving as a Computer Science Associate Professor of Computer Science Emeritus at Stanford University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Serge Plotkin

Stanford University

Associate Professor of Computer Science Emeritus

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

Combinatorial Optimization for Sensor Networks. (2006)

Serge PlotkinZoe Abrams

network sciencecombinatorial optimizationapplied mathematics

Time-Lapse Snapshots. Springer eBooks (2006)

Cynthia DworkMaurice HerlihySerge A. PlotkinOrli Waarts

systems engineeringcomputer visiontime-lapse snapshots

A Non-Manipulable Trust System Based on Eigentrust. ACM SIGecom Exchanges (2005)

Zoë AbramsRobert McGrewSerge Plotkin

non-manipulable trust systemtrustbehavioral sciences

Approximate Majorization and Fair Online Load Balancing. ACM Transactions on Algorithms (2005)

Ashish GoelAdam MeyersonSerge Plotkin

approximate majorizationcomputer sciencemachine learningload balancing (computing)online algorithmsapplied mathematics

A K-Median Algorithm With Running Time Independent of Data Size. Machine Learning (2004)

Adam MeyersonLiadan O'CallaghanSerge Plotkin

k-median algorithmdata sizemachine learningrunning timeapplied mathematics

An Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control. Journal of Algorithms (2004)

Ashish GoelMonika R. HenzingerSerge Plotkin

network routing algorithmmulticast routingcommunicationonline algorithmstransportation engineeringonline throughput-competitive algorithmadmission controlalgorithm design

Keeping Peers Honest in Eigentrust. (2004)

Zoë AbramsRobert McGrewSerge Plotkin

peer relationshipsbehavioral sciencestrustcommunication

Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks. (2004)

Zoë AbramsAshish GoelSerge Plotkin

systems engineeringmachine learningenergy efficient monitoringk-cover algorithms

Scheduling Data Transfers in a Network and the Set Scheduling Problem. Journal of Algorithms (2003)

Ashish GoelMonika R. HenzingerSerge PlotkinEva Tardos

Approximating a Finite Metric by a Small Number of Tree Metrics. (2002)

M. CharikarC. ChekuriA. GoelS. GuhaS. Plotkin

1
2
3
4
5
6
10 / page

Similar Faculty Members

Ming-Yang Kao

Institution

Northwestern University

computer science

applied mathematics

Ashish Goel

Institution

Stanford University

algorithm design

network algorithm

Sanjeev Khanna

Institution

University of Pennsylvania

discrete algorithm

combinatorial problem

A. Kevin Tang

Institution

Cornell University

game theory

control optimization

Torsten Suel

Institution

New York University

scalability

data engineering

Greg Frederickson

Institution

Purdue University

network algorithm

discrete algorithm

David P. Williamson

Institution

Cornell University

network science

network algorithm

Chandra Sekhar Chekuri

Institution

University of Illinois Urbana-Champaign

analysis of algorithm

applied mathematics

Clifford Stein

Institution

Columbia University

computer science

applied mathematics

Deeparnab Chakrabarty

Institution

Dartmouth College

algorithm design

technological forecasting

Similar Faculty Members

Ming-Yang Kao

Institution

Northwestern University

computer science

applied mathematics

Ashish Goel

Institution

Stanford University

algorithm design

network algorithm

Sanjeev Khanna

Institution

University of Pennsylvania

discrete algorithm

combinatorial problem

A. Kevin Tang

Institution

Cornell University

game theory

control optimization

Torsten Suel

Institution

New York University

scalability

data engineering

Greg Frederickson

Institution

Purdue University

network algorithm

discrete algorithm

David P. Williamson

Institution

Cornell University

network science

network algorithm

Chandra Sekhar Chekuri

Institution

University of Illinois Urbana-Champaign

analysis of algorithm

applied mathematics

Clifford Stein

Institution

Columbia University

computer science

applied mathematics

Deeparnab Chakrabarty

Institution

Dartmouth College

algorithm design

technological forecasting