Published in: LIPIcs, Volume 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)
Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, and Neal E. Young. Online Paging with Heterogeneous Cache Slots. In 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 254, pp. 23:1-23:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{chrobak_et_al:LIPIcs.STACS.2023.23, author = {Chrobak, Marek and Haney, Samuel and Liaee, Mehraneh and Panigrahi, Debmalya and Rajaraman, Rajmohan and Sundaram, Ravi and Young, Neal E.}, title = {{Online Paging with Heterogeneous Cache Slots}}, booktitle = {40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)}, pages = {23:1--23:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-266-2}, ISSN = {1868-8969}, year = {2023}, volume = {254}, editor = {Berenbrink, Petra and Bouyer, Patricia and Dawar, Anuj and Kant\'{e}, Mamadou Moustapha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.23}, URN = {urn:nbn:de:0030-drops-176759}, doi = {10.4230/LIPIcs.STACS.2023.23}, annote = {Keywords: Caching and paging algorithms, k-server, weighted paging, laminar family} }
Published in: LIPIcs, Volume 214, 16th International Symposium on Parameterized and Exact Computation (IPEC 2021)
Akanksha Agrawal, Ravi Kiran Allumalla, and Varun Teja Dhanekula. Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 2:1-2:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{agrawal_et_al:LIPIcs.IPEC.2021.2, author = {Agrawal, Akanksha and Allumalla, Ravi Kiran and Dhanekula, Varun Teja}, title = {{Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {2:1--2:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.2}, URN = {urn:nbn:de:0030-drops-153851}, doi = {10.4230/LIPIcs.IPEC.2021.2}, annote = {Keywords: Token Jumping, Bipartite Graphs, Fixed Parameter Intractability, Half Graphs, Gap-Exponential Time Hypothesis} }
Published in: LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021)
Thomas Lavastida, Benjamin Moseley, R. Ravi, and Chenyang Xu. Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 59:1-59:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{lavastida_et_al:LIPIcs.ESA.2021.59, author = {Lavastida, Thomas and Moseley, Benjamin and Ravi, R. and Xu, Chenyang}, title = {{Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {59:1--59:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.59}, URN = {urn:nbn:de:0030-drops-146405}, doi = {10.4230/LIPIcs.ESA.2021.59}, annote = {Keywords: Learning-augmented algorithms, Online algorithms, Flow allocation} }
Published in: LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020)
Nai-Hui Chia, András Gilyén, Han-Hsuan Lin, Seth Lloyd, Ewin Tang, and Chunhao Wang. Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the Dimension. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 47:1-47:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chia_et_al:LIPIcs.ISAAC.2020.47, author = {Chia, Nai-Hui and Gily\'{e}n, Andr\'{a}s and Lin, Han-Hsuan and Lloyd, Seth and Tang, Ewin and Wang, Chunhao}, title = {{Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the Dimension}}, booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)}, pages = {47:1--47:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-173-3}, ISSN = {1868-8969}, year = {2020}, volume = {181}, editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.47}, URN = {urn:nbn:de:0030-drops-133916}, doi = {10.4230/LIPIcs.ISAAC.2020.47}, annote = {Keywords: sublinear algorithms, quantum-inspired, regression, importance sampling, quantum machine learning} }
Published in: LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
Hassene Aissi, Da Qi Chen, and R. Ravi. Vertex Downgrading to Minimize Connectivity. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 162, pp. 5:1-5:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{aissi_et_al:LIPIcs.SWAT.2020.5, author = {Aissi, Hassene and Chen, Da Qi and Ravi, R.}, title = {{Vertex Downgrading to Minimize Connectivity}}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)}, pages = {5:1--5:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-150-4}, ISSN = {1868-8969}, year = {2020}, volume = {162}, editor = {Albers, Susanne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2020.5}, URN = {urn:nbn:de:0030-drops-122527}, doi = {10.4230/LIPIcs.SWAT.2020.5}, annote = {Keywords: Vertex Interdiction, Vertex Downgrading, Network Interdiction, Approximation Algorithm} }
Published in: LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
S. Rathinam, R. Ravi, J. Bae, and K. Sundar. Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman Problem. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 162, pp. 33:1-33:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{rathinam_et_al:LIPIcs.SWAT.2020.33, author = {Rathinam, S. and Ravi, R. and Bae, J. and Sundar, K.}, title = {{Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman Problem}}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)}, pages = {33:1--33:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-150-4}, ISSN = {1868-8969}, year = {2020}, volume = {162}, editor = {Albers, Susanne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2020.33}, URN = {urn:nbn:de:0030-drops-122805}, doi = {10.4230/LIPIcs.SWAT.2020.33}, annote = {Keywords: Approximation Algorithm, Heterogeneous Traveling Salesman Problem, Primal-dual Method} }
Published in: LIPIcs, Volume 145, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)
David Ellis Hershkowitz, R. Ravi, and Sahil Singla. Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 145, pp. 4:1-4:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{hershkowitz_et_al:LIPIcs.APPROX-RANDOM.2019.4, author = {Hershkowitz, David Ellis and Ravi, R. and Singla, Sahil}, title = {{Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {4:1--4:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-125-2}, ISSN = {1868-8969}, year = {2019}, volume = {145}, editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.4}, URN = {urn:nbn:de:0030-drops-112196}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.4}, annote = {Keywords: Approximation Algorithms, Optimization Under Uncertainty, Two-Stage Optimization, Expected Max} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
R. Ravi and Oleksandr Rudenko. Multicommodity Multicast, Wireless and Fast. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 78:1-78:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{ravi_et_al:LIPIcs.ESA.2019.78, author = {Ravi, R. and Rudenko, Oleksandr}, title = {{Multicommodity Multicast, Wireless and Fast}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {78:1--78:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.78}, URN = {urn:nbn:de:0030-drops-111991}, doi = {10.4230/LIPIcs.ESA.2019.78}, annote = {Keywords: Rumor, scheduling, broadcast, multicommodity, multicast, optimization algorithms, approximation, packet routing} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Jie Xue, Yuan Li, Saladi Rahul, and Ravi Janardan. New Bounds for Range Closest-Pair Problems. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 73:1-73:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{xue_et_al:LIPIcs.SoCG.2018.73, author = {Xue, Jie and Li, Yuan and Rahul, Saladi and Janardan, Ravi}, title = {{New Bounds for Range Closest-Pair Problems}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {73:1--73:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.73}, URN = {urn:nbn:de:0030-drops-87865}, doi = {10.4230/LIPIcs.SoCG.2018.73}, annote = {Keywords: Closest-pair, Range search, Candidate pairs, Average-case analysis} }
Published in: LIPIcs, Volume 81, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)
Samuel Haney, Bruce Maggs, Biswaroop Maiti, Debmalya Panigrahi, Rajmohan Rajaraman, and Ravi Sundaram. Symmetric Interdiction for Matching Problems. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 81, pp. 9:1-9:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{haney_et_al:LIPIcs.APPROX-RANDOM.2017.9, author = {Haney, Samuel and Maggs, Bruce and Maiti, Biswaroop and Panigrahi, Debmalya and Rajaraman, Rajmohan and Sundaram, Ravi}, title = {{Symmetric Interdiction for Matching Problems}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {9:1--9:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-044-6}, ISSN = {1868-8969}, year = {2017}, volume = {81}, editor = {Jansen, Klaus and Rolim, Jos\'{e} D. P. and Williamson, David P. and Vempala, Santosh S.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.9}, URN = {urn:nbn:de:0030-drops-75587}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.9}, annote = {Keywords: Approximation algorithms, matching, interdiction Digital Object} }
Published in: LIPIcs, Volume 81, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)
Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, and Jens Vygen. On the Integrality Gap of the Prize-Collecting Steiner Forest LP. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 81, pp. 17:1-17:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{konemann_et_al:LIPIcs.APPROX-RANDOM.2017.17, author = {K\"{o}nemann, Jochen and Olver, Neil and Pashkovich, Kanstantsin and Ravi, R. and Swamy, Chaitanya and Vygen, Jens}, title = {{On the Integrality Gap of the Prize-Collecting Steiner Forest LP}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {17:1--17:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-044-6}, ISSN = {1868-8969}, year = {2017}, volume = {81}, editor = {Jansen, Klaus and Rolim, Jos\'{e} D. P. and Williamson, David P. and Vempala, Santosh S.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.17}, URN = {urn:nbn:de:0030-drops-75665}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.17}, annote = {Keywords: Integrality gap, Steiner tree, Steiner forest, prize-collecting, Lagrangianmultiplier- preserving} }
Published in: LIPIcs, Volume 76, 29th Euromicro Conference on Real-Time Systems (ECRTS 2017)
Prachi Joshi, Haibo Zeng, Unmesh D. Bordoloi, Soheil Samii, S. S. Ravi, and Sandeep K. Shukla. The Multi-Domain Frame Packing Problem for CAN-FD. In 29th Euromicro Conference on Real-Time Systems (ECRTS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 76, pp. 12:1-12:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{joshi_et_al:LIPIcs.ECRTS.2017.12, author = {Joshi, Prachi and Zeng, Haibo and Bordoloi, Unmesh D. and Samii, Soheil and Ravi, S. S. and Shukla, Sandeep K.}, title = {{The Multi-Domain Frame Packing Problem for CAN-FD}}, booktitle = {29th Euromicro Conference on Real-Time Systems (ECRTS 2017)}, pages = {12:1--12:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-037-8}, ISSN = {1868-8969}, year = {2017}, volume = {76}, editor = {Bertogna, Marko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2017.12}, URN = {urn:nbn:de:0030-drops-71551}, doi = {10.4230/LIPIcs.ECRTS.2017.12}, annote = {Keywords: Frame Packing, CAN-FD, Integer Linear Programming, Audsley's Algorithm} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Jie Xue, Yuan Li, and Ravi Janardan. On the Separability of Stochastic Geometric Objects, with Applications. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 62:1-62:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{xue_et_al:LIPIcs.SoCG.2016.62, author = {Xue, Jie and Li, Yuan and Janardan, Ravi}, title = {{On the Separability of Stochastic Geometric Objects, with Applications}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {62:1--62:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-009-5}, ISSN = {1868-8969}, year = {2016}, volume = {51}, editor = {Fekete, S\'{a}ndor and Lubiw, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.62}, URN = {urn:nbn:de:0030-drops-59544}, doi = {10.4230/LIPIcs.SoCG.2016.62}, annote = {Keywords: Stochastic objects, linear separability, separable-probability, expected separation-margin, convex hull} }
Published in: Dagstuhl Seminar Proceedings, Volume 10141, Distributed Usage Control (2010)
Sandro Etalle, Alexander Pretschner, Ravi S. Sandhu, and Marianne Winslett. 10141 Abstracts Collection – Distributed Usage Control. In Distributed Usage Control. Dagstuhl Seminar Proceedings, Volume 10141, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{etalle_et_al:DagSemProc.10141.1, author = {Etalle, Sandro and Pretschner, Alexander and Sandhu, Ravi S. and Winslett, Marianne}, title = {{10141 Abstracts Collection – Distributed Usage Control}}, booktitle = {Distributed Usage Control}, pages = {1--12}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10141}, editor = {Sandro Etalle and Alexander Pretschner and Raiv S. Sandhu and Marianne Winslett}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10141.1}, URN = {urn:nbn:de:0030-drops-27185}, doi = {10.4230/DagSemProc.10141.1}, annote = {Keywords: Usage control, access control, data protection, privacy, security policies, trust, trusted computing, compliance, DRM, information flow} }
Published in: Dagstuhl Seminar Proceedings, Volume 10141, Distributed Usage Control (2010)
Sandro Etalle, Alexander Pretschner, Ravi S. Sandhu, and Marianne Winslett. 10141 Summary – Distributed Usage Control. In Distributed Usage Control. Dagstuhl Seminar Proceedings, Volume 10141, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{etalle_et_al:DagSemProc.10141.2, author = {Etalle, Sandro and Pretschner, Alexander and Sandhu, Ravi S. and Winslett, Marianne}, title = {{10141 Summary – Distributed Usage Control}}, booktitle = {Distributed Usage Control}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10141}, editor = {Sandro Etalle and Alexander Pretschner and Raiv S. Sandhu and Marianne Winslett}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10141.2}, URN = {urn:nbn:de:0030-drops-27174}, doi = {10.4230/DagSemProc.10141.2}, annote = {Keywords: Usage control, access control, data protection, privacy, security policies, trust, trusted computing, compliance, DRM, information flow} }
Feedback for Dagstuhl Publishing