Published in: LIPIcs, Volume 153, 23rd International Conference on Principles of Distributed Systems (OPODIS 2019)
Xiong Zheng and Vijay K. Garg. Parallel and Distributed Algorithms for the Housing Allocation Problem. In 23rd International Conference on Principles of Distributed Systems (OPODIS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 153, pp. 23:1-23:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{zheng_et_al:LIPIcs.OPODIS.2019.23, author = {Zheng, Xiong and Garg, Vijay K.}, title = {{Parallel and Distributed Algorithms for the Housing Allocation Problem}}, booktitle = {23rd International Conference on Principles of Distributed Systems (OPODIS 2019)}, pages = {23:1--23:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-133-7}, ISSN = {1868-8969}, year = {2020}, volume = {153}, editor = {Felber, Pascal and Friedman, Roy and Gilbert, Seth and Miller, Avery}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2019.23}, URN = {urn:nbn:de:0030-drops-118090}, doi = {10.4230/LIPIcs.OPODIS.2019.23}, annote = {Keywords: Parallel Algorithm, Distributed Algorithm, Housing Allocation, Housing Markets, Pareto optimality} }
Published in: LIPIcs, Volume 153, 23rd International Conference on Principles of Distributed Systems (OPODIS 2019)
Xiong Zheng, Vijay K. Garg, and John Kaippallimalil. Linearizable Replicated State Machines With Lattice Agreement. In 23rd International Conference on Principles of Distributed Systems (OPODIS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 153, pp. 29:1-29:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{zheng_et_al:LIPIcs.OPODIS.2019.29, author = {Zheng, Xiong and Garg, Vijay K. and Kaippallimalil, John}, title = {{Linearizable Replicated State Machines With Lattice Agreement}}, booktitle = {23rd International Conference on Principles of Distributed Systems (OPODIS 2019)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-133-7}, ISSN = {1868-8969}, year = {2020}, volume = {153}, editor = {Felber, Pascal and Friedman, Roy and Gilbert, Seth and Miller, Avery}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2019.29}, URN = {urn:nbn:de:0030-drops-118158}, doi = {10.4230/LIPIcs.OPODIS.2019.29}, annote = {Keywords: Lattice Agreement, Generalized Lattice Agreement, Replicated State Machine, Consensus} }
Published in: LIPIcs, Volume 121, 32nd International Symposium on Distributed Computing (DISC 2018)
Xiong Zheng, Changyong Hu, and Vijay K. Garg. Lattice Agreement in Message Passing Systems. In 32nd International Symposium on Distributed Computing (DISC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 121, pp. 41:1-41:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{zheng_et_al:LIPIcs.DISC.2018.41, author = {Zheng, Xiong and Hu, Changyong and Garg, Vijay K.}, title = {{Lattice Agreement in Message Passing Systems}}, booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)}, pages = {41:1--41:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-092-7}, ISSN = {1868-8969}, year = {2018}, volume = {121}, editor = {Schmid, Ulrich and Widder, Josef}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.41}, URN = {urn:nbn:de:0030-drops-98301}, doi = {10.4230/LIPIcs.DISC.2018.41}, annote = {Keywords: Lattice Agreement, Replicated State Machine, Consensus} }
Published in: LIPIcs, Volume 95, 21st International Conference on Principles of Distributed Systems (OPODIS 2017)
Himanshu Chauhan and Vijay K. Garg. Fast Detection of Stable and Count Predicates in Parallel Computations. In 21st International Conference on Principles of Distributed Systems (OPODIS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 95, pp. 20:1-20:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chauhan_et_al:LIPIcs.OPODIS.2017.20, author = {Chauhan, Himanshu and Garg, Vijay K.}, title = {{Fast Detection of Stable and Count Predicates in Parallel Computations}}, booktitle = {21st International Conference on Principles of Distributed Systems (OPODIS 2017)}, pages = {20:1--20:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-061-3}, ISSN = {1868-8969}, year = {2018}, volume = {95}, editor = {Aspnes, James and Bessani, Alysson and Felber, Pascal and Leit\~{a}o, Jo\~{a}o}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2017.20}, URN = {urn:nbn:de:0030-drops-86496}, doi = {10.4230/LIPIcs.OPODIS.2017.20}, annote = {Keywords: Algorithms, Theory, Predicate Detection, Parallel Programs} }
Published in: LIPIcs, Volume 91, 31st International Symposium on Distributed Computing (DISC 2017)
Vijay K. Garg. Brief Announcement: Applying Predicate Detection to the Stable Marriage Problem. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 52:1-52:3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{garg:LIPIcs.DISC.2017.52, author = {Garg, Vijay K.}, title = {{Brief Announcement: Applying Predicate Detection to the Stable Marriage Problem}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {52:1--52:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.52}, URN = {urn:nbn:de:0030-drops-79719}, doi = {10.4230/LIPIcs.DISC.2017.52}, annote = {Keywords: Stable Matching, Linear Predicates, Distributive Lattices} }
Published in: LIPIcs, Volume 70, 20th International Conference on Principles of Distributed Systems (OPODIS 2016)
Yen-Jung Chang and Vijay K. Garg. Predicate Detection for Parallel Computations with Locking Constraints. In 20th International Conference on Principles of Distributed Systems (OPODIS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 70, pp. 17:1-17:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{chang_et_al:LIPIcs.OPODIS.2016.17, author = {Chang, Yen-Jung and Garg, Vijay K.}, title = {{Predicate Detection for Parallel Computations with Locking Constraints}}, booktitle = {20th International Conference on Principles of Distributed Systems (OPODIS 2016)}, pages = {17:1--17:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-031-6}, ISSN = {1868-8969}, year = {2017}, volume = {70}, editor = {Fatourou, Panagiota and Jim\'{e}nez, Ernesto and Pedone, Fernando}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2016.17}, URN = {urn:nbn:de:0030-drops-70867}, doi = {10.4230/LIPIcs.OPODIS.2016.17}, annote = {Keywords: predicate detection, parallel computations, reachable global states, locking constraints, happened-before relation} }
Published in: LIPIcs, Volume 46, 19th International Conference on Principles of Distributed Systems (OPODIS 2015)
Yen-Jung Chang and Vijay K. Garg. QuickLex: A Fast Algorithm for Consistent Global States Enumeration of Distributed Computations. In 19th International Conference on Principles of Distributed Systems (OPODIS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 46, pp. 25:1-25:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{chang_et_al:LIPIcs.OPODIS.2015.25, author = {Chang, Yen-Jung and Garg, Vijay K.}, title = {{QuickLex: A Fast Algorithm for Consistent Global States Enumeration of Distributed Computations}}, booktitle = {19th International Conference on Principles of Distributed Systems (OPODIS 2015)}, pages = {25:1--25:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-98-9}, ISSN = {1868-8969}, year = {2016}, volume = {46}, editor = {Anceaume, Emmanuelle and Cachin, Christian and Potop-Butucaru, Maria}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2015.25}, URN = {urn:nbn:de:0030-drops-66142}, doi = {10.4230/LIPIcs.OPODIS.2015.25}, annote = {Keywords: consistent global state, algorithm, computation} }
Published in: LIPIcs, Volume 46, 19th International Conference on Principles of Distributed Systems (OPODIS 2015)
Wei-Lun Hung, Himanshu Chauhan, and Vijay K. Garg. ActiveMonitor: Asynchronous Monitor Framework for Scalability and Multi-Object Synchronization. In 19th International Conference on Principles of Distributed Systems (OPODIS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 46, pp. 29:1-29:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{hung_et_al:LIPIcs.OPODIS.2015.29, author = {Hung, Wei-Lun and Chauhan, Himanshu and Garg, Vijay K.}, title = {{ActiveMonitor: Asynchronous Monitor Framework for Scalability and Multi-Object Synchronization}}, booktitle = {19th International Conference on Principles of Distributed Systems (OPODIS 2015)}, pages = {29:1--29:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-98-9}, ISSN = {1868-8969}, year = {2016}, volume = {46}, editor = {Anceaume, Emmanuelle and Cachin, Christian and Potop-Butucaru, Maria}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2015.29}, URN = {urn:nbn:de:0030-drops-66188}, doi = {10.4230/LIPIcs.OPODIS.2015.29}, annote = {Keywords: concurrent/parallel programming, monitors, concurrency} }
Published in: LIPIcs, Volume 40, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)
Vijay V. S. P. Bhattiprolu, Venkatesan Guruswami, and Euiwoong Lee. Approximate Hypergraph Coloring under Low-discrepancy and Related Promises. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 40, pp. 152-174, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bhattiprolu_et_al:LIPIcs.APPROX-RANDOM.2015.152, author = {Bhattiprolu, Vijay V. S. P. and Guruswami, Venkatesan and Lee, Euiwoong}, title = {{Approximate Hypergraph Coloring under Low-discrepancy and Related Promises}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)}, pages = {152--174}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-89-7}, ISSN = {1868-8969}, year = {2015}, volume = {40}, editor = {Garg, Naveen and Jansen, Klaus and Rao, Anup and Rolim, Jos\'{e} D. P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.152}, URN = {urn:nbn:de:0030-drops-53011}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2015.152}, annote = {Keywords: Hypergraph Coloring, Discrepancy, Rainbow Coloring, Stong Coloring, Algorithms, Semidefinite Programming, Hardness of Approximation} }
Published in: LIPIcs, Volume 40, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)
Venkatesan Guruswami and Euiwoong Lee. Inapproximability of H-Transversal/Packing. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 40, pp. 284-304, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{guruswami_et_al:LIPIcs.APPROX-RANDOM.2015.284, author = {Guruswami, Venkatesan and Lee, Euiwoong}, title = {{Inapproximability of H-Transversal/Packing}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)}, pages = {284--304}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-89-7}, ISSN = {1868-8969}, year = {2015}, volume = {40}, editor = {Garg, Naveen and Jansen, Klaus and Rao, Anup and Rolim, Jos\'{e} D. P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.284}, URN = {urn:nbn:de:0030-drops-53085}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2015.284}, annote = {Keywords: Constraint Satisfaction Problems, Approximation resistance} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, and Ali Kemal Sinop. The Hardness of Approximation of Euclidean k-Means. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 754-767, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{awasthi_et_al:LIPIcs.SOCG.2015.754, author = {Awasthi, Pranjal and Charikar, Moses and Krishnaswamy, Ravishankar and Sinop, Ali Kemal}, title = {{The Hardness of Approximation of Euclidean k-Means}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {754--767}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.754}, URN = {urn:nbn:de:0030-drops-51178}, doi = {10.4230/LIPIcs.SOCG.2015.754}, annote = {Keywords: Euclidean k-means, Hardness of Approximation, Vertex Cover} }
Published in: LIPIcs, Volume 30, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)
Karl Bringmann, Danny Hermelin, Matthias Mnich, and Erik Jan van Leeuwen. Parameterized Complexity Dichotomy for Steiner Multicut. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 157-170, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bringmann_et_al:LIPIcs.STACS.2015.157, author = {Bringmann, Karl and Hermelin, Danny and Mnich, Matthias and van Leeuwen, Erik Jan}, title = {{Parameterized Complexity Dichotomy for Steiner Multicut}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {157--170}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.157}, URN = {urn:nbn:de:0030-drops-49115}, doi = {10.4230/LIPIcs.STACS.2015.157}, annote = {Keywords: graph cut problems, Steiner cut, fixed-parameter tractability} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Shanfei Li. An Improved Approximation Algorithm for the Hard Uniform Capacitated k-median Problem. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 325-338, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{li:LIPIcs.APPROX-RANDOM.2014.325, author = {Li, Shanfei}, title = {{An Improved Approximation Algorithm for the Hard Uniform Capacitated k-median Problem}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {325--338}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.325}, URN = {urn:nbn:de:0030-drops-47062}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.325}, annote = {Keywords: Approximation algorithm; k-median problem; LP-rounding; Hard capacities} }
Feedback for Dagstuhl Publishing