The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of Joseph Naor Seffi Naor ( http://dblp.L3S.de/Authors/Joseph_Naor )

Publication years (Num. hits)
1983-1990 (18) 1991-1994 (15) 1995-1997 (17) 1998-2000 (23) 2001-2002 (19) 2003-2004 (18) 2005-2006 (22) 2007-2008 (21) 2009-2010 (17) 2011-2012 (14)
Publication types (Num. hits)
article(81) inproceedings(102) proceedings(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 152 occurrences of 97 keywords

Results
Found 184 publication records. Showing 184 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Edward Bortnikov, Samir Khuller, Jian Li, Yishay Mansour, Joseph Naor The load-distance balancing problem. Search on Bibsonomy Networks The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Niv Buchbinder, Joseph Naor Randomized Competitive Algorithms for Generalized Caching. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz Min-Max Graph Partitioning and Small Set Expansion Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor A Polylogarithmic-Competitive Algorithm for the k-Server Problem Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Moran Feldman, Joseph Naor, Roy Schwartz, Justin Ward Improved Approximations for k-Exchange Systems - (Extended Abstract). Search on Bibsonomy ESA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Moran Feldman, Joseph Naor, Roy Schwartz Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract). Search on Bibsonomy ICALP The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor Frequency Capping in Online Advertising. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv A Truthful Mechanism for Value-Based Scheduling in Cloud Computing. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Moran Feldman, Joseph Naor, Roy Schwartz Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract). Search on Bibsonomy APPROX-RANDOM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Joseph Naor, Debmalya Panigrahi, Mohit Singh Online Node-Weighted Steiner Tree and Related Problems. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Moran Feldman, Joseph Naor, Roy Schwartz A Unified Continuous Greedy Algorithm for Submodular Maximization. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor A Polylogarithmic-Competitive Algorithm for the k-Server Problem. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz Min-max Graph Partitioning and Small Set Expansion. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Joseph Naor, Roy Schwartz The directed circular arrangement problem. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda Non-Cooperative Cost Sharing Games via Subsidies. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Joseph Naor, Adi Rosén, Gabriel Scalosub Online time-constrained scheduling in linear and ring networks. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Niv Buchbinder, Joseph Naor Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. Search on Bibsonomy SODA The full citation details ... 2010 DBLP  BibTeX  RDF
1Nikhil Bansal, Kamal Jain, Anna Kazeykina, Joseph Naor Approximation Algorithms for Diversified Search Ranking. Search on Bibsonomy ICALP The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Niv Buchbinder, Joseph Naor Metrical Task Systems and the k-Server Problem on HSTs. Search on Bibsonomy ICALP The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Moran Feldman, Joseph Naor Non-Preemptive Buffer Management for Latency Sensitive Packets. Search on Bibsonomy INFOCOM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. Search on Bibsonomy INFOCOM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Joseph Naor The Design of Competitive Online Algorithms via a Primal-Dual Approach. Search on Bibsonomy Foundations and Trends in Theoretical Computer Science The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai Throughput maximization of real-time scheduling with batching. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF local ratio technique, Scheduling, batching
1Niv Buchbinder, Joseph Naor Online Primal-Dual Algorithms for Covering and Packing. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh Survivable Network Design with Degree or Order Constraints. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor The Online Set Cover Problem. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Robert Krauthgamer, Joseph Naor, Roy Schwartz Partitioning graphs into balanced components. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. Search on Bibsonomy INFOCOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Joseph Naor, Danny Raz, Gabriel Scalosub Toward Optimal Utilization of Shared Random Access Channels. Search on Bibsonomy INFOCOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Irit Dinur, Klaus Jansen, Joseph Naor, José D. P. Rolim (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha On the approximability of some network design problems. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF cost-distance, fixed charge network flow, priority Steiner tree, network design, Hardness of approximation
1Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Joseph Naor, Baruch Schieber Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Confluent flows, Management flows, Dynamic programming, Combinatorial optimization, Network management, Traffic engineering
1Joseph Naor, Danny Raz, Gabriel Scalosub Homogeneous Interference Game in Wireless Networks. Search on Bibsonomy WINE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda Non-cooperative Cost Sharing Games Via Subsidies. Search on Bibsonomy SAGT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks Online multicast with egalitarian cost sharing. Search on Bibsonomy SPAA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF best response, nash equilibrium, price of anarchy, shapley value
1Nikhil Bansal, Niv Buchbinder, Joseph Naor Randomized competitive algorithms for generalized caching. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF arbitrary sizes, arbitrary weights, knapsack cover inequalities, primal-dual analysis, caching, online algorithms
1Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF linear and semidefinite programming, metric labelling, multiway cut, integrality gaps, unique games conjecture
1Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum Editorial. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Joseph Naor, Hadas Shachnai, Tami Tamir Real-Time Scheduling with a Budget. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor Algorithmic aspects of bandwidth trading. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Approximation algorithms for NP-hard problems, scheduling, resource allocation, dynamic storage allocation, general caching
1Julia Chuzhoy, Joseph Naor The Hardness of Metric Labeling. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda Non-Cooperative Multicast and Facility Location Games. Search on Bibsonomy IEEE Journal on Selected Areas in Communications The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor Cut problems in graphs with a budget constraint. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching. Search on Bibsonomy ESA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Kamal Jain, Joseph Naor Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. Search on Bibsonomy ESA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Roee Engelberg, Joseph Naor Equilibria in online games. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1David Amzallag, Joseph Naor, Danny Raz Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks. Search on Bibsonomy INFOCOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Niv Buchbinder, Joseph Naor A Primal-Dual Randomized Algorithm for Weighted Paging. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh Survivable network design with degree or order constraints. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF approximation algorithms, network design, NP-hard problems, bounded degree, iterative rounding
1Liane Lewin-Eytan, Joseph Naor, Ariel Orda Maximum-lifetime routing: system optimization & game-theoretic perspectives. Search on Bibsonomy MobiHoc The full citation details ... 2007 DBLP  DOI  BibTeX  RDF anycast game, multicast game, nash equilibrium, price of anarchy, price of stability
1Yigal Bejerano, Joseph Naor, Alexander Sprintson Efficient algorithms for shared backup allocation in networks with partial information. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Quality of service, Approximation algorithms, Combinatorial optimization, Resource sharing, Restoration, Fault resilience
1Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor A general approach to online network optimization problems. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Online network optimization, group Steiner, multi-cuts, competitive analysis, facility location, randomized rounding
1Yigal Bejerano, Mark A. Smith, Joseph Naor, Nicole Immorlica Efficient location area planning for personal communication systems. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF location area planning, terms-approximation algorithms, mobility management, cellular systems, personal communication system
1Julia Chuzhoy, Joseph Naor New hardness results for congestion minimization and machine scheduling. Search on Bibsonomy J. ACM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF resource minimization, scheduling, network routing, Hardness of approximation, congestion minimization
1Chandra Chekuri, Sudipto Guha, Joseph Naor The Steiner k-Cut Problem. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira Scheduling Split Intervals. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Julia Chuzhoy, Joseph Naor Covering Problems with Hard Capacities. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor Cut Problems in Graphs with a Budget Constraint. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Joseph Naor Fair online load balancing. Search on Bibsonomy SPAA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF scheduling, load balancing, online algorithms, competitive analysis, greedy algorithm
1David Amzallag, Joseph Naor, Danny Raz Coping with Interference: From Maximum Coverage to Planning Cellular Networks. Search on Bibsonomy WAOA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda Non-cooperative multicast and facility location games. Search on Bibsonomy ACM Conference on Electronic Commerce The full citation details ... 2006 DBLP  DOI  BibTeX  RDF multicast game, nash equilibrium, price of anarchy, price of stability
1Niv Buchbinder, Joseph Naor Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz Building Edge-Failure Resilient Networks. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Backup path, Approximation algorithm, Network design, Restoration, Link failure
1Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor Asymmetric k-center is log* n-hard to approximate. Search on Bibsonomy J. ACM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF asymmetric k-center, metric k-center, Approximation algorithms, hardness of approximation
1Yigal Bejerano, Joseph Naor, Alexander Sprintson Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Joseph Naor Online Primal-Dual Algorithms for Covering and Packing Problems. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Joseph Naor From Balanced Graph Partitioning to Balanced Metric Labeling. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Moses Charikar, Sanjeev Khanna, Joseph Naor Approximating the average response time in broadcast scheduling. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha On the approximability of some network design problems. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Joseph Naor, Adi Rosén, Gabriel Scalosub Online time-constrained scheduling in linear networks. Search on Bibsonomy INFOCOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Joseph Naor, Roy Schwartz Balanced metric labeling. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF balanced-partition, metric-labeling
1Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber Traffic engineering of management flows by link augmentations on confluent trees. Search on Bibsonomy SPAA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF approximation algorithms, network management, traffic engineering
1Liane Lewin-Eytan, Joseph Naor, Ariel Orda Admission Control in Networks with Advance Reservations. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Line network, Axis parallel rectangles, Approximation algorithms, Independent set, Advance reservations, Local ratio
1Ari Freund, Joseph Naor Approximating the Advertisement Placement Problem. Search on Bibsonomy J. Scheduling The full citation details ... 2004 DBLP  DOI  BibTeX  RDF scheduling, approximation algorithms, web-advertising
1Moses Charikar, Joseph Naor, Baruch Schieber Resource optimization in QoS multicast routing of real-time multimedia. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Joseph Naor, Roy Schwartz The directed circular arrangement problem. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor A general approach to online network optimization problems. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor Machine Minimization for Scheduling Jobs with Interval Constraints. Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Julia Chuzhoy, Joseph Naor The Hardness of Metric Labeling. Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor Asymmetric k-center is log* n-hard to approximate. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF asymmetric k-center, metric k-center, approximation algorithms, hardness of approximation
1Julia Chuzhoy, Joseph Naor New hardness results for congestion minimization and machine scheduling. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF routing, approximation algorithms, hardness of approximation, machine scheduling, congestion minimization
1Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor Asymmetric k-center is log*n-hard to Approximate Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2003 DBLP  BibTeX  RDF
1Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor Competitive On-Line Switching Policies. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Packet switching, On-line algorithms
1Amotz Bar-Noy, Joseph Naor, Baruch Schieber Pushing Dependent Data in Clients-Providers-Servers Systems. Search on Bibsonomy Wireless Networks The full citation details ... 2003 DBLP  DOI  BibTeX  RDF clients-providers-servers, de-randomization, scheduling, broadcast disks
1Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor Algorithmic Aspects of Bandwidth Trading. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF bandwidth trading, primal-dual schema, Scheduling, approximation algorithms
1Joseph Naor, Hadas Shachnai, Tami Tamir Real-Time Scheduling with a Budget. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Chandra Chekuri, Sudipto Guha, Joseph Naor Approximating Steiner k-Cuts. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Multiway Cut, $k$-Cut, Steiner tree, minimum cut, primal-dual
1Yigal Bejerano, Nicole Immorlica, Joseph Naor, Mark Smith Efficient location area planning for personal communication systems. Search on Bibsonomy MOBICOM The full citation details ... 2003 DBLP  DOI  BibTeX  RDF location area planning, approximation algorithms, mobility management, cellular systems, personal communication system
1Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor The online set cover problem. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF competitive analysis, on-line algorithms, set-cover, derandomization, randomized rounding
1Yigal Bejerano, Israel Cidon, Joseph Naor Efficient handoff rerouting algorithms: a competitive on-line algorithmic approach. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF handoff rerouting algorithms, personal communication systems (PCS), online algorithms, competitive analysis, connection management
1Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber Minimizing Service and Operation Costs of Periodic Scheduling. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira Scheduling split intervals. Search on Bibsonomy SODA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai Throughput maximization of real-time scheduling with batching. Search on Bibsonomy SODA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor Competitive on-line switching policies. Search on Bibsonomy SODA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Sanjeev Khanna, Joseph Naor, Danny Raz Control Message Aggregation in Group Communication Protocols. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Juan A. Garay, Joseph Naor, Bülent Yener, Peng Zhao On-line Admission Control and Packet Scheduling with Interleaving. Search on Bibsonomy INFOCOM The full citation details ... 2002 DBLP  BibTeX  RDF
1Ari Freund, Joseph Naor Approximating the Advertisement Placement Problem. Search on Bibsonomy IPCO The full citation details ... 2002 DBLP  BibTeX  RDF
Displaying result #1 - #100 of 184 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.