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