Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Carmi, Paz"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Switching to directional antennas with constant increase in radius and hop distance
Prosenjit Bose
,
Paz Carmi
,
Mirela Damian
,
Robin Flatland
,
Matthew J. Katz
,
Anil Maheshwari
Algorithmica
69
(2), 2014, pp. 397-409
Bottleneck non-crossing matching in the plane
A. Karim Abu-Affash
,
Paz Carmi
,
Matthew J. Katz
,
Yohai Trabelsi
Lecture Notes in Computer Science
7501
, 2012, pp. 36-47
Unexplored Steiner ratios in geometric networks
Paz Carmi
,
Lilach Chaitman-Yerushalmi
Lecture Notes in Computer Science
7434
, 2012, pp. 275-286
Location-oblivious distributed unit disk graph coloring
Michel Barbeau
,
Prosenjit Bose
,
Paz Carmi
,
Mathieu Couture
,
Evangelos Kranakis
Algorithmica
60
(2), 2011, pp. 236-249
Switching to directional antennas with constant increase in radius and hop distance
Prosenjit Bose
,
Paz Carmi
,
Mirela Damian
,
Robin Flatland
,
Matthew J. Katz
,
Anil Maheshwari
Lecture Notes in Computer Science
6844
, 2011, pp. 134-146
The MST of symmetric disk graphs is light
A. Karim Abu-Affash
,
Rom Aschner
,
Paz Carmi
,
Matthew J. Katz
Lecture Notes in Computer Science
6139
, 2010, pp. 236-247
Computing the greedy spanner in near-quadratic time
Prosenjit Bose
,
Paz Carmi
,
Mohammad Farshi
,
Anil Maheshwari
,
Michiel Smid
Algorithmica
58
(3), 2010, pp. 711-729
Improved methods for generating quasi-Gray codes
Prosenjit Bose
,
Paz Carmi
,
Dana Jansens
,
Anil Maheshwari
,
Pat Morin
,
Michiel Smid
Lecture Notes in Computer Science
6139
, 2010, pp. 224-235
Communication-efficient construction of the plane localized Delaunay graph
Prosenjit Bose
,
Paz Carmi
,
Michiel Smid
,
Daming Xu
Lecture Notes in Computer Science
6034
, 2010, pp. 282-293
An optimal algorithm for computing angle-constrained spanners
Paz Carmi
,
Michiel Smid
Lecture Notes in Computer Science
6506
, 2010, pp. 316-327
On the power of the semi-separated pair decomposition
Mohammad Ali Abam
,
Paz Carmi
,
Mohammad Farshi
,
Michiel Smid
Lecture Notes in Computer Science
5664
, 2009, pp. 1-12
Minimum-cost load-balancing partitions
Boris Aronov
,
Paz Carmi
,
Matthew J. Katz
Algorithmica
54
(3), 2009, pp. 318-336
Matrix columns allocation problems
Amos Beimel
,
Boaz Ben-Moshe
,
Yehuda Ben-Shimol
,
Paz Carmi
,
Eldad Chai
,
Itzik Kitroser
,
Eran Omri
Theoretical Computer Science
410
(21-23), 2009, pp. 2174-2183
Private approximation of search problems
Amos Beimel
,
Paz Carmi
,
Kobbi Nissim
,
Enav Weinreb
SIAM Journal on Computing
38
(5), 2008-2009, pp. 1728-1760
Single vehicle scheduling problems on path/tree/cycle networks with release and handling times
Binay Bhattacharya
,
Paz Carmi
,
Yuzhuang Hu
,
Qiaosheng Shi
Lecture Notes in Computer Science
5369
, 2008, pp. 800-811
On the stretch factor of convex Delaunay graphs
Prosenjit Bose
,
Paz Carmi
,
Sébastien Collette
,
Michiel Smid
Lecture Notes in Computer Science
5369
, 2008, pp. 656-667
Spanners of complete
k
-partite geometric graphs
Prosenjit Bose
,
Paz Carmi
,
Mathieu Couture
,
Anil Maheshwari
,
Pat Morin
,
Michiel Smid
SIAM Journal on Computing
38
(5), 2008-2009, pp. 1803-1820
Spanners of additively weighted point sets
Prosenjit Bose
,
Paz Carmi
,
Mathieu Couture
Lecture Notes in Computer Science
5124
, 2008, pp. 367-377
Computing the greedy spanner in near-quadratic time
Prosenjit Bose
,
Paz Carmi
,
Mohammad Farshi
,
Anil Maheshwari
,
Michiel Smid
Lecture Notes in Computer Science
5124
, 2008, pp. 390-401
On a family of strong geometric spanners that admit local routing strategies
Prosenjit Bose
,
Paz Carmi
,
Mathieu Couture
,
Michiel Smid
,
Daming Xu
Lecture Notes in Computer Science
4619
, 2007, pp. 300-311
Covering points by unit disks of fixed location
Paz Carmi
,
Matthew J. Katz
,
Nissan Lev-Tov
Lecture Notes in Computer Science
4835
, 2007, pp. 644-655
Power assignment in radio networks with two power levels
Paz Carmi
,
Matthew J. Katz
Algorithmica
47
(2), 2007, pp. 183-201
Private approximation of search problems
Amos Beimel
,
Paz Carmi
,
Kobbi Nissim
,
Enav Weinreb
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 119-128
Geographic quorum system approximations
Paz Carmi
,
Shlomi Dolev
,
Sariel Har-Peled
,
Matthew J. Katz
,
Michael Segal
Algorithmica
41
(4), 2005, pp. 233-244
The minimum-area spanning tree problem
Paz Carmi
,
Matthew J. Katz
,
Joseph S.B. Mitchell
Lecture Notes in Computer Science
3608
, 2005, pp. 195-204
Seiten 1
2
>