Spremljaj
Reuven BarYehuda
Reuven BarYehuda
Emeritus Professor of Computer Science, Technion - Israel Institute of Technology
Preverjeni e-poštni naslov na cs.technion.ac.il - Domača stran
Naslov
Navedeno
Navedeno
Leto
On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
R Bar-Yehuda, O Goldreich, A Itai
Journal of Computer and System Sciences 45 (1), 104-126, 1992
622*1992
A local-ratio theorem for approximating the weighted vertex cover problem
R Bar-Yehuda, S Even
North-Holland Mathematics Studies 109, 27-45, 1985
5941985
A linear-time approximation algorithm for the weighted vertex cover problem
R Bar-Yehuda, S Even
Journal of Algorithms 2 (2), 198-203, 1981
5911981
A unified approach to approximating resource allocation and scheduling
A Bar-Noy, R Bar-Yehuda, A Freund, J Naor, B Schieber
Journal of the ACM (JACM) 48 (5), 1069-1090, 2001
5482001
Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference
R Bar-Yehuda, D Geiger, J Naor, RM Roth
SIAM journal on computing 27 (4), 942-959, 1998
2451998
Scheduling split intervals
R Bar-Yehuda, MM Halldórsson, J Naor, H Shachnai, I Shapira
SIAM Journal on Computing 36 (1), 1-15, 2006
2192006
Randomized algorithms for the loop cutset problem
A Becker, R Bar-Yehuda, D Geiger
Journal of Artificial Intelligence Research 12, 219-234, 2000
1822000
Local ratio: A unified framework for approximation algorithms. in memoriam: Shimon even 1935-2004
R Bar-Yehuda, K Bendel, A Freund, D Rawitz
ACM Computing Surveys (CSUR) 36 (4), 422-463, 2004
1482004
Multiple communication in multihop radio networks
R Bar-Yehuda, A Israeli, A Itai
SIAM Journal on Computing 22 (4), 875-887, 1993
1461993
Time/space tradeoffs for polygon mesh rendering
R Bar-Yehuda, C Gotsman
ACM Transactions on Graphics (TOG) 15 (2), 141-152, 1996
1351996
Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
R Bar-Yehuda, O Goldreich, A Itai
Distributed Computing 5 (2), 67-71, 1991
1321991
One for the price of two: A unified approach for approximating covering problems
R Bar-Yehuda
Algorithmica 27, 131-144, 2000
1302000
Using homogeneous weights for approximating the partial cover problem
R Bar-Yehuda
Journal of Algorithms 39 (2), 137-144, 2001
1292001
Cell selection in 4G cellular networks
D Amzallag, R Bar-Yehuda, D Raz, G Scalosub
IEEE INFOCOM 2008-The 27th Conference on Computer Communications, 700-708, 2008
116*2008
Matching of freeform curves
S Cohen, G Elber, R Bar-Yehuda
Computer-Aided Design 29 (5), 369-378, 1997
981997
On approximating a geometric prize-collecting traveling salesman problem with time windows
R Bar-Yehuda, G Even, SM Shahar
Journal of Algorithms 55 (1), 76-92, 2005
892005
On the equivalence between the primal-dual schema and the local ratio technique
R Bar-Yehuda, D Rawitz
SIAM Journal on Discrete Mathematics 19 (3), 762-797, 2005
79*2005
Privacy, additional information and communication
R Bar-Yehuda, B Chor, E Kushilevitz, A Orlitsky
IEEE Transactions on Information Theory 39 (6), 1930-1943, 1993
781993
On approximating a vertex cover for planar graphs
R Bar-Yehuda, S Even
Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982
711982
Triangulating disjoint Jordan chains
R Bar-Yehuda, B Chazelle
International Journal of Computational Geometry & Applications 4 (04), 475-481, 1994
691994
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20