|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 49 occurrences of 44 keywords
|
|
|
|
|
Results
Found 66 publication records. Showing 66 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Yuval Emek, Magnús M. Halldórsson, Adi Rosén |
Space-Constrained Interval Selection  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén |
Online computation with advice. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Adi Rosén, Gabriel Scalosub |
Rate vs. buffer size-greedy information gathering on the line. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Räcke, Adi Rosén |
Approximation Algorithms for Time-Constrained Scheduling on Line Networks. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paz Carmi, Matthew J. Katz, Zvi Lotker, Adi Rosén |
Connectivity guarantees for wireless networks with directional antennas. |
Comput. Geom. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc P. Renault, Adi Rosén |
On Online Algorithms with Advice for the k-Server Problem. |
WAOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén |
On the additive constant of the k-server Work Function Algorithm. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Gordon, Adi Rosén |
Competitive weighted throughput analysis of greedy protocols on DAGs. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Adi Rosén |
Fully decentralized computation of aggregates over data streams. |
SIGKDD Explorations |
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 | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén |
On the Additive Constant of the k-server Work Function Algorithm |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Zvi Lotker, Boaz Patt-Shamir, Adi Rosén |
Distributed Approximate Matching. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén |
Online Computation with Advice. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Räcke, Adi Rosén |
Approximation algorithms for time-constrained scheduling on line networks. |
SPAA |
2009 |
DBLP DOI BibTeX RDF |
line networks, time constraints, packet scheduling |
| 1 | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén |
On the Additive Constant of the k-Server Work Function Algorithm. |
WAOA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kesselman, Adi Rosén |
Controlling CIOQ Switches with Priority Queuing and in Multistage Interconnection Networks. |
Journal of Interconnection Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Adi Rosén, Gabriel Scalosub |
Rate vs. buffer size: greedy information gathering on the line. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
competitive network throughput, online algorithms, competitive analysis, buffer management, information gathering |
| 1 | Zvi Lotker, Boaz Patt-Shamir, Adi Rosén |
Distributed approximate matching. |
PODC |
2007 |
DBLP DOI BibTeX RDF |
distributed algorithms, graph algorithms, dynamic algorithms, maximum matching, distributed approximation algorithms |
| 1 | Alexander Kesselman, Adi Rosén |
Scheduling policies for CIOQ switches. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Adi Rosén, Michael S. Tsirkin |
On Delivery Times in Packet Networks under Adversarial Traffic. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén |
Competitive queue policies for differentiated services. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Micah Adler, Adi Rosén |
Tight bounds for the performance of Longest In System on DAGs. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Gál, Adi Rosén |
Omega(log n) Lower Bounds on the Amount of Randomness in 2-Private Computation. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Räcke, Adi Rosén |
Distributed online call control on general networks. |
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 | Eyal Gordon, Adi Rosén |
Competitive weighted throughput analysis of greedy protocols on DAGs. |
PODC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Lotker, Boaz Patt-Shamir, Adi Rosén |
New stability results for adversarial queuing. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Guez, Alexander Kesselman, Adi Rosén |
Packet-mode policies for input-queued switches. |
SPAA |
2004 |
DBLP DOI BibTeX RDF |
packet-mode scheduling, competitive analysis, input-queued switches |
| 1 | Adi Rosén, Michael S. Tsirkin |
On delivery times in packet networks under adversarial traffic. |
SPAA |
2004 |
DBLP DOI BibTeX RDF |
adversarial queuing theory, delivery time, protocols, stability, packet networks |
| 1 | Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén |
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Approximation algorithm, Deadline, Packet routing |
| 1 | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Amortizing Randomness in Private Multiparty Computations. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosén |
Dynamic routing on networks with fixed-size buffers. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kesselman, Adi Rosén |
Scheduling policies for CIOQ switches. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
CIOQ switches, competitive analysis, buffer management, scheduling policies |
| 1 | Anna Gál, Adi Rosén |
Lower bounds on the amount of randomness in private computation. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
lower bounds, randomness, private computation |
| 1 | Adi Rosén |
A note on models for non-probabilistic analysis of packet switching networks. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Gál, Adi Rosén |
A Theorem on Sensitivity and Applications in Private Computation. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Micah Adler, Adi Rosén |
Tight Bounds for the Performance of Longest-in-System on DAGs. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Lotker, Boaz Patt-Shamir, Adi Rosén |
New stability results for adversarial queuing. |
SPAA |
2002 |
DBLP DOI BibTeX RDF |
adversarial queuing theory |
| 1 | Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén |
On-Line Competitive Algorithms for Call Admission in Optical Networks. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén |
On-line Randomized Call Control Revisited . |
SIAM J. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Randomness versus Fault-Tolerance. |
J. Cryptology |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Adaptive Packet Routing for Bursty Adversarial Traffic. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén |
Competitive Queue Policies for Differentiated Services. |
INFOCOM |
2000 |
DBLP BibTeX RDF |
|
| 1 | Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén |
On Capital Investment. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
On-line financial problems, On-line algorithms, Competitive ratio |
| 1 | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Characterizing Linear Size Circuits in Terms of Pricacy. |
J. Comput. Syst. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén |
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. |
SPAA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Gál, Adi Rosén |
A Theorem on Sensitivity and Applications in Private Computation. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Adi Rosén |
A Randomness-Rounds Tradeoff in Private Computation. |
SIAM J. Discrete Math. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Log-Space Polynomial End-to-End Communication. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén |
On-line Randomized Call Control Revisited. |
SODA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Amortizing Randomness in Private Multiparty Computations. |
PODC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Adaptive Packet Routing for Bursty Adversarial Traffic. |
STOC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, Adi Rosén |
The Distributed k-Server Problem - A Competitive Distributed Translator for k-Server Algorithms. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Afek, Baruch Awerbuch, Eli Gafni, Yishay Mansour, Adi Rosén, Nir Shavit |
Slide-The Key to Polynomial End-to-End Communication. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Randomness vs. Fault-Tolerance. |
PODC |
1997 |
DBLP BibTeX RDF |
|
| 1 | Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén |
On-line Competive Algorithms for Call Admission in Optical Networks. |
ESA |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks |
Randomized Robot Navigation Algorithms. |
SODA |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén |
On Capital Investment. |
ICALP |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Characterizing Linear Size Circuits in Terms of Privacy. |
STOC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Log-Space Polynomial End-to-End Communication (Abstract). |
PODC |
1995 |
DBLP BibTeX RDF |
|
| 1 | Amos Fiat, Yishay Mansour, Adi Rosén, Orli Waarts |
Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version). |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
competitive access time, dynamic storage rearrangement, industrial stacker crane warehouse, automatic robot run warehouse, disk track optimization, two dimensional memory management, bubble memory, doubly linked list management, computational complexity, database, graph theory, lower bounds, optimisation, database management systems, upper bounds, server, storage allocation, probability distribution, tree structure, tree data structures, operations research, undirected graph, process migration, competitive algorithms, competitive algorithms, warehouse, disk storage, mass storage systems |
| 1 | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén |
Log-space polynomial end-to-end communication. |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Baruch Awerbuch, Yair Bartal, Amos Fiat, Adi Rosén |
Competitive Non-Preemptive Call Control. |
SODA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Kushilevitz, Adi Rosén |
A Randomnesss-Rounds Tradeoff in Private Computation. |
CRYPTO |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Afek, Eli Gafni, Adi Rosén |
The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract). |
PODC |
1992 |
DBLP BibTeX RDF |
|
| 1 | Yair Bartal, Adi Rosén |
The Distributed k-Server Problem-A Competitive Distributed Translator for k-Server Algorithms |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
poly(k)-competitive distributed algorithms, distributed k-server problem, competitive distributed translator, mobile servers, mobile resources, control messages, computer networks, communication cost, competitive ratios |
Displaying result #1 - #66 of 66 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")