Adi Rosén

According to our database1, Adi Rosén authored at least 63 papers between 1992 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Multi-Party Protocols, Information Complexity and Privacy.
TOCT, 2019

Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

A New Approach to Multi-Party Peer-to-Peer Communication Complexity.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018
Online Bin Packing with Advice of Small Size.
Theory Comput. Syst., 2018

2017
Reordering buffer management with advice.
J. Scheduling, 2017

Sublinear Random Access Generators for Preferential Attachment Graphs.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Approximating Semi-matchings in Streaming and in Two-Party Communication.
ACM Trans. Algorithms, 2016

Semi-Streaming Set Cover.
ACM Trans. Algorithms, 2016

Space-Constrained Interval Selection.
ACM Trans. Algorithms, 2016

Clique Here: On the Distributed Complexity in Fully-Connected Networks.
Parallel Processing Letters, 2016

Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems.
Algorithmica, 2016

Unconditionally Secure Computation with Reduced Interaction.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Online Budgeted Maximum Coverage.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

A Constant Approximation Algorithm for Scheduling Packets on Line Networks.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Online algorithms with advice for bin packing and scheduling problems.
Theor. Comput. Sci., 2015

On Online Algorithms with Advice for the k-Server Problem.
Theory Comput. Syst., 2015

Paid Exchanges are Worth the Price.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014
Semi-Streaming Set Cover - (Extended Abstract).
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2011
Online computation with advice.
Theor. Comput. Sci., 2011

Rate vs. buffer size-greedy information gathering on the line.
ACM Trans. Algorithms, 2011

Approximation Algorithms for Time-Constrained Scheduling on Line Networks.
Theory Comput. Syst., 2011

Connectivity guarantees for wireless networks with directional antennas.
Comput. Geom., 2011

2010
Competitive weighted throughput analysis of greedy protocols on DAGs.
ACM Trans. Algorithms, 2010

Fully decentralized computation of aggregates over data streams.
SIGKDD Explorations, 2010

Online time-constrained scheduling in linear and ring networks.
J. Discrete Algorithms, 2010

On the additive constant of the k-server Work Function Algorithm.
Inf. Process. Lett., 2010

2009
Distributed Approximate Matching.
SIAM J. Comput., 2009

On the Additive Constant of the k-Server Work Function Algorithm.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

2008
Controlling CIOQ Switches with Priority Queuing and in Multistage Interconnection Networks.
Journal of Interconnection Networks, 2008

2006
On Delivery Times in Packet Networks under Adversarial Traffic.
Theory Comput. Syst., 2006

Scheduling policies for CIOQ switches.
J. Algorithms, 2006

2005
Omega(log n) Lower Bounds on the Amount of Randomness in 2-Private Computation.
SIAM J. Comput., 2005

Competitive queue policies for differentiated services.
J. Algorithms, 2005

Tight bounds for the performance of Longest In System on DAGs.
J. Algorithms, 2005

Distributed online call control on general networks.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Online time-constrained scheduling in linear networks.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

2004
New stability results for adversarial queuing.
SIAM J. Comput., 2004

Packet-mode policies for input-queued switches.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

2003
Amortizing Randomness in Private Multiparty Computations.
SIAM J. Discrete Math., 2003

Time-Constrained Scheduling of Weighted Packets on Trees and Meshes.
Algorithmica, 2003

Lower bounds on the amount of randomness in private computation.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Dynamic routing on networks with fixed-size buffers.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
A Theorem on Sensitivity and Applications in Private Computation.
SIAM J. Comput., 2002

A note on models for non-probabilistic analysis of packet switching networks.
Inf. Process. Lett., 2002

2001
On-line Randomized Call Control Revisited .
SIAM J. Comput., 2001

On-Line Competitive Algorithms for Call Admission in Optical Networks.
Algorithmica, 2001

2000
Randomness versus Fault-Tolerance.
J. Cryptology, 2000

Adaptive Packet Routing for Bursty Adversarial Traffic.
J. Comput. Syst. Sci., 2000

1999
Characterizing Linear Size Circuits in Terms of Pricacy.
J. Comput. Syst. Sci., 1999

On Capital Investment.
Algorithmica, 1999

1998
A Randomness-Rounds Tradeoff in Private Computation.
SIAM J. Discrete Math., 1998

Log-Space Polynomial End-to-End Communication.
SIAM J. Comput., 1998

1997
The Distributed k-Server Problem - A Competitive Distributed Translator for k-Server Algorithms.
J. Algorithms, 1997

Slide-The Key to Polynomial End-to-End Communication.
J. Algorithms, 1997

Randomness vs. Fault-Tolerance.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

1996
Characterizing Linear Size Circuits in Terms of Privacy.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Randomized Robot Navigation Algorithms.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

On-line Competive Algorithms for Call Admission in Optical Networks.
Proceedings of the Algorithms, 1996

1995
Log-Space Polynomial End-to-End Communication (Abstract).
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version).
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
Competitive Non-Preemptive Call Control.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

A Randomnesss-Rounds Tradeoff in Private Computation.
Proceedings of the Advances in Cryptology, 1994

1992
The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract).
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992


  Loading...