Yazar

Serge Plotkin

20 cilt bulundu.

Cilt sonuçları

CiltFast Approximation Algorithm for Minimum Cost Multicommodity FlowStanford University. Computer Science Department, Anil Kamath, Omri Palmon, Serge Plotkin

Fast Approximation Algorithm for Minimum Cost Multicommodity Flow

Stanford University. Computer Science Department, Anil Kamath, Omri Palmon, Serge Plotkin · Yayınevi bilinmiyor

10 sayfa · 1995

Kategori yok

CiltAn Improved Lower Bound for Load Balancing of Tasks with Unknown DurationStanford University. Computer Science Department, Serge Plotkin, Yuan Ma

An Improved Lower Bound for Load Balancing of Tasks with Unknown Duration

Stanford University. Computer Science Department, Serge Plotkin, Yuan Ma · Yayınevi bilinmiyor

3 sayfa · 1996

Kategori yok

Data transmission systemsRouting and Admission Control in General Topology Networks with Poisson ArrivalsAnil Kamath, Omri Palmon, Stanford University. Computer Science Department, Serge Plotkin

Routing and Admission Control in General Topology Networks with Poisson Arrivals

Anil Kamath, Omri Palmon, Stanford University. Computer Science Department, Serge Plotkin · Yayınevi bilinmiyor

17 sayfa · 1996

Data transmission systems

Combinatorial optimizationAn implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flowAndrew Vladislav Goldberg, Jeffrey D. Oldham, Stanford University. Computer Science Department, Serge Plotkin, Cliff Stein

An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow

Andrew Vladislav Goldberg, Jeffrey D. Oldham, Stanford University. Computer Science Department, Serge Plotkin, Cliff Stein · Yayınevi bilinmiyor

19 sayfa · 1997

Computer algorithmsRouting and Admission Control in General Topology NetworksRainer Gawlick, Stanford University. Computer Science Department, Anil Kamath, Serge Plotkin, K. G. Ramakrishnan

Routing and Admission Control in General Topology Networks

Rainer Gawlick, Stanford University. Computer Science Department, Anil Kamath, Serge Plotkin, K. G. Ramakrishnan · Yayınevi bilinmiyor

18 sayfa · 1995

Computer algorithms

AlgorithmsOnline Throughput-Competitive Algorithm for Multicast Routing and Admission ControlAshish Goel, Stanford University. Computer Science Dept, Monika R. Henzinger, Serge Plotkin

Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control

Ashish Goel, Stanford University. Computer Science Dept, Monika R. Henzinger, Serge Plotkin · Yayınevi bilinmiyor

16 sayfa · 1997

Algorithms

AlgorithmsPolynomial Dual Network Simplex AlgorithmsJames B. Orlin, Serge A. Plotkin, Éva Tardos

Polynomial Dual Network Simplex Algorithms

James B. Orlin, Serge A. Plotkin, Éva Tardos · Yayınevi bilinmiyor

23 sayfa · 1991

Algorithms

CiltParallel (delta + 1) Coloring of Constant-degree GraphsA. V. Goldberg, S. A. Plotkin

Parallel (delta + 1) Coloring of Constant-degree Graphs

A. V. Goldberg, S. A. Plotkin · Yayınevi bilinmiyor

9 sayfa · 1986

Kategori yok

AlgorithmsEfficient Parallel Algorithms for ([Delta] + 1)-coloring and Maximal Independent Set ProblemsAndrew V. Goldberg, Massachusetts Institute of Technology. Laboratory for Computer Science, Serge A. Plotkin

Efficient Parallel Algorithms for ([Delta] + 1)-coloring and Maximal Independent Set Problems

Andrew V. Goldberg, Massachusetts Institute of Technology. Laboratory for Computer Science, Serge A. Plotkin · Yayınevi bilinmiyor

24 sayfa · 1987

Algorithms

AlgorithmsCombinatorial Algorithms for the Generalized Circulation ProblemAndrew V. Goldberg, Serge A. Plotkin, Éva Tardos

Combinatorial Algorithms for the Generalized Circulation Problem

Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos · Yayınevi bilinmiyor

36 sayfa · 1988

Algorithms

Client/server computingCost-distanceBilinmeyen yazar

Cost-distance

Bilinmeyen yazar · Yayınevi bilinmiyor

Sayfa sayısı yok · 2001

Client/server computing

AlgorithmsSublinear-time Parallel Algorithms for Matching and Related ProblemsAndrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya

Sublinear-time Parallel Algorithms for Matching and Related Problems

Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya · Yayınevi bilinmiyor

25 sayfa · 1988

Algorithms

Combinatorial optimizationLecture Notes: Topics in Combinatorial OptimizationAndrew V. Goldberg, Stanford University. Computer Science Department, Serge A. Plotkin

Lecture Notes: Topics in Combinatorial Optimization

Andrew V. Goldberg, Stanford University. Computer Science Department, Serge A. Plotkin · Yayınevi bilinmiyor

85 sayfa · 1992

Combinatorial optimization

Cache memoryWeb Caching Using Access StatisticsBilinmeyen yazar

Web Caching Using Access Statistics

Bilinmeyen yazar · Yayınevi bilinmiyor

Sayfa sayısı yok · 2001

Cache memory

Electronic data processingGraph-theoretic techniques for parallel, distributed, and sequential computationSerge A. Plotkin

Graph-theoretic techniques for parallel, distributed, and sequential computation

Serge A. Plotkin · Yayınevi bilinmiyor

177 sayfa · 1988

Electronic data processing

CiltParallel Symmetrie-breaking in Sparse GraphsAndrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon

Parallel Symmetrie-breaking in Sparse Graphs

Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon · Yayınevi bilinmiyor

23 sayfa · 1988

Kategori yok

Graph theoryParallel Symmetry-breaking in Sparse GraphsAndrew V. Goldberg, Serge A. Plotkin, Massachusetts Institute of Technology. Laboratory for Computer Science, Gregory E. Shannon

Parallel Symmetry-breaking in Sparse Graphs

Andrew V. Goldberg, Serge A. Plotkin, Massachusetts Institute of Technology. Laboratory for Computer Science, Gregory E. Shannon · Yayınevi bilinmiyor

23 sayfa · 1988

Graph theory

Linear programmingA Sublinear Parallel Algorithm for Stable MatchingInternational Business Machines Corporation. Research Division, Tomás Feder, Nimrod Megiddo, Serge A. Plotkin

A Sublinear Parallel Algorithm for Stable Matching

International Business Machines Corporation. Research Division, Tomás Feder, Nimrod Megiddo, Serge A. Plotkin · Yayınevi bilinmiyor

11 sayfa · 1993

Linear programming

Approximation theoryAdventures in Ultra-small-space ClusteringAdam Meyerson, Liadan O'Callaghan, Serge A. Plotkin

Adventures in Ultra-small-space Clustering

Adam Meyerson, Liadan O'Callaghan, Serge A. Plotkin · Yayınevi bilinmiyor

11 sayfa · 2002

Approximation theory

AlgorithmsApproximating the Size of a Dynamically Growing Asynchronous Distributed NetworkBaruch Awerbuch, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE., Serge A. Plotkin

Approximating the Size of a Dynamically Growing Asynchronous Distributed Network

Baruch Awerbuch, MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE., Serge A. Plotkin · Yayınevi bilinmiyor

17 sayfa · 1987

Algorithms