sort by
approximate search
1shortlisttitle datasearch history  
results search [or] ISN:0000000073745178 | 1 hits
Person
ISNI: 
0000 0000 7374 5178
Name: 
Éva Tardos (Hongaars wiskundige)
Éva Tardos (Hungarian mathematician)
Éva Tardos (informática teórica húngara)
Éva Tardos (matematico ungherese)
Éva Tardos (mathématicienne d'origine hongroise née en 1957 lauréate du prix Fulkerson et du prix Gödel pour des articles en maths discrètes)
Éva Tardos (ungarischer Mathematiker)
Tardos, É.
Tardos, Éva
טארדוש, אווה
‏טרדוש, אוה
ايفا تاردوس
タルドシュ
Dates: 
born 1957-10-01
Creation class: 
cre
Language material
Text
txt
Creation role: 
author
contributor
Related names: 
Barahona, Francisco
Kleinberg, Jon
Lenstra, J.K.
Lenstra, Jan Karel
Plotkin, Serge A.
Roughgarden, Tim
Shmoys, D.B.
Shmoys, David B.
האוניברסיטה הפתוחה
‏מנדל, מנור
קלינברג, ג'ון
浅野, 泰仁
Titles: 
Algorithm design.
Algorithmic game theory
Allocating bandwidth for bursty connections
Approximation algorithms for classification problems with pairwise relationships
Approximation algorithms for scheduling unrelated parallel machines
Approximations for the disjoint paths problem in high-diameter planar networks
Arugorizumu dezain.
Bounding the inefficiency of equilibria in nonatomic congestion games
Combinatorial algorithms for the generalized circulation problem, 1988:
constant factor approximation algorithm for a class of classification problems, A
Constant-factor approximation algorithm for the k-median problem
Disjoint paths in densely embedded graphs
Distributed packet switching in arbitrary networks
effect of collusion in congestion games, The
Facility location with hierarchical facility costs
Fairness in routing and load balancing
Fast approximation algorithms for fractional packing and covering problems
Fast approximation algorithms for multicommodity flow problems
Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts
How bad is selfish routing?
Improved bounds on the max-flow min-cut ratio for multicommodity flows
n88168238
Near-optimal network design with selfish agents
Network design for information networks
network pricing game for selfish traffic, A
Note on Weintraub's minimum cost flow algorithm
On fractional multicommodity flows and distance functions
Pituaḥ algoritmim .
Polynomial dual network simplex algorithms
Scheduling data transfers in a network and the set scheduling problem
Separating maximally violated comb inequalities in planar graphs
Trading networks with price-setting agents
Truthful mechanisms for one-parameter agents
‏פיתוח אלגוריתמים ; תרגום, תמר אלמוג ; עריכה מדעית, מנור מנדל.
アルゴリズムデザイン
Notes: 
Sources: 
VIAF LAC LC NDL NLI NUKAT SUDOC WKD
BOWKER
NTA
TEL