Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Honghao Fu, Daochen Wang, and Qi Zhao. Parallel Self-Testing of EPR Pairs Under Computational Assumptions. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 64:1-64:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{fu_et_al:LIPIcs.ICALP.2023.64, author = {Fu, Honghao and Wang, Daochen and Zhao, Qi}, title = {{Parallel Self-Testing of EPR Pairs Under Computational Assumptions}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {64:1--64:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.64}, URN = {urn:nbn:de:0030-drops-181160}, doi = {10.4230/LIPIcs.ICALP.2023.64}, annote = {Keywords: Quantum complexity theory, self-testing, LWE} }
Published in: LIPIcs, Volume 245, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)
Yi Li, Honghao Lin, David P. Woodruff, and Yuheng Zhang. Streaming Algorithms with Large Approximation Factors. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 245, pp. 13:1-13:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{li_et_al:LIPIcs.APPROX/RANDOM.2022.13, author = {Li, Yi and Lin, Honghao and Woodruff, David P. and Zhang, Yuheng}, title = {{Streaming Algorithms with Large Approximation Factors}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)}, pages = {13:1--13:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-249-5}, ISSN = {1868-8969}, year = {2022}, volume = {245}, editor = {Chakrabarti, Amit and Swamy, Chaitanya}, 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.2022.13}, URN = {urn:nbn:de:0030-drops-171354}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.13}, annote = {Keywords: streaming algorithms, 𝓁\underlinep norm, heavy hitters, distinct elements} }
Published in: LIPIcs, Volume 186, 24th International Conference on Database Theory (ICDT 2021)
Shangqi Lu and Yufei Tao. Towards Optimal Dynamic Indexes for Approximate (and Exact) Triangle Counting. In 24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, pp. 6:1-6:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{lu_et_al:LIPIcs.ICDT.2021.6, author = {Lu, Shangqi and Tao, Yufei}, title = {{Towards Optimal Dynamic Indexes for Approximate (and Exact) Triangle Counting}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {6:1--6:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-179-5}, ISSN = {1868-8969}, year = {2021}, volume = {186}, editor = {Yi, Ke and Wei, Zhewei}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.6}, URN = {urn:nbn:de:0030-drops-137146}, doi = {10.4230/LIPIcs.ICDT.2021.6}, annote = {Keywords: Triangle Counting, Data Structures, Lower Bounds, Graph Algorithms} }
Published in: LIPIcs, Volume 102, 33rd Computational Complexity Conference (CCC 2018)
Yi-Hsiu Chen, Mika Göös, Salil P. Vadhan, and Jiapeng Zhang. A Tight Lower Bound for Entropy Flattening. In 33rd Computational Complexity Conference (CCC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 102, pp. 23:1-23:28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chen_et_al:LIPIcs.CCC.2018.23, author = {Chen, Yi-Hsiu and G\"{o}\"{o}s, Mika and Vadhan, Salil P. and Zhang, Jiapeng}, title = {{A Tight Lower Bound for Entropy Flattening}}, booktitle = {33rd Computational Complexity Conference (CCC 2018)}, pages = {23:1--23:28}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-069-9}, ISSN = {1868-8969}, year = {2018}, volume = {102}, editor = {Servedio, Rocco A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.23}, URN = {urn:nbn:de:0030-drops-88669}, doi = {10.4230/LIPIcs.CCC.2018.23}, annote = {Keywords: Entropy, One-way function} }
Published in: LIPIcs, Volume 31, 18th International Conference on Database Theory (ICDT 2015)
Xiaocheng Hu, Yufei Tao, Yi Yang, Shengyu Zhang, and Shuigeng Zhou. On The I/O Complexity of Dynamic Distinct Counting. In 18th International Conference on Database Theory (ICDT 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 31, pp. 265-276, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{hu_et_al:LIPIcs.ICDT.2015.265, author = {Hu, Xiaocheng and Tao, Yufei and Yang, Yi and Zhang, Shengyu and Zhou, Shuigeng}, title = {{On The I/O Complexity of Dynamic Distinct Counting}}, booktitle = {18th International Conference on Database Theory (ICDT 2015)}, pages = {265--276}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-79-8}, ISSN = {1868-8969}, year = {2015}, volume = {31}, editor = {Arenas, Marcelo and Ugarte, Mart{\'\i}n}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2015.265}, URN = {urn:nbn:de:0030-drops-49895}, doi = {10.4230/LIPIcs.ICDT.2015.265}, annote = {Keywords: distinct counting, lower bound, external memory} }
Published in: OASIcs, Volume 36, 5th Workshop on Medical Cyber-Physical Systems (2014)
Paolo Masci, Yi Zhang, Paul Jones, Harold Thimbleby, and Paul Curzon. A Generic User Interface Architecture for Analyzing Use Hazards in Infusion Pump Software. In 5th Workshop on Medical Cyber-Physical Systems. Open Access Series in Informatics (OASIcs), Volume 36, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{masci_et_al:OASIcs.MCPS.2014.1, author = {Masci, Paolo and Zhang, Yi and Jones, Paul and Thimbleby, Harold and Curzon, Paul}, title = {{A Generic User Interface Architecture for Analyzing Use Hazards in Infusion Pump Software}}, booktitle = {5th Workshop on Medical Cyber-Physical Systems}, pages = {1--14}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-66-8}, ISSN = {2190-6807}, year = {2014}, volume = {36}, editor = {Turau, Volker and Kwiatkowska, Marta and Mangharam, Rahul and Weyer, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.MCPS.2014.1}, URN = {urn:nbn:de:0030-drops-45185}, doi = {10.4230/OASIcs.MCPS.2014.1}, annote = {Keywords: Infusion Pump, Hazard analysis, Use hazards, User Interface, Interactive software, Design errors} }
Published in: OASIcs, Volume 18, Bringing Theory to Practice: Predictability and Performance in Embedded Systems (2011)
Yi Zhang, Nan Guan, and Wang Yi. Towards the Implementation and Evaluation of Semi-Partitioned Multi-Core Scheduling. In Bringing Theory to Practice: Predictability and Performance in Embedded Systems. Open Access Series in Informatics (OASIcs), Volume 18, pp. 42-46, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{zhang_et_al:OASIcs.PPES.2011.42, author = {Zhang, Yi and Guan, Nan and Yi, Wang}, title = {{Towards the Implementation and Evaluation of Semi-Partitioned Multi-Core Scheduling}}, booktitle = {Bringing Theory to Practice: Predictability and Performance in Embedded Systems}, pages = {42--46}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-28-6}, ISSN = {2190-6807}, year = {2011}, volume = {18}, editor = {Lucas, Philipp and Wilhelm, Reinhard}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.PPES.2011.42}, URN = {urn:nbn:de:0030-drops-30804}, doi = {10.4230/OASIcs.PPES.2011.42}, annote = {Keywords: real-time operating system, multi-core, semi-partitioned scheduling} }
Published in: Dagstuhl Seminar Proceedings, Volume 6431, Scalable Data Management in Evolving Networks (2007)
Peter A. Boncz and Yi Zhang. P2P XQuery and the StreetTiVo application. In Scalable Data Management in Evolving Networks. Dagstuhl Seminar Proceedings, Volume 6431, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{boncz_et_al:DagSemProc.06431.6, author = {Boncz, Peter A. and Zhang, Yi}, title = {{P2P XQuery and the StreetTiVo application}}, booktitle = {Scalable Data Management in Evolving Networks}, pages = {1--1}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6431}, editor = {Stefan B\"{o}ttcher and Le Gruenwald and Pedro Jose Marr\'{o}n and Evaggelia Pitoura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06431.6}, URN = {urn:nbn:de:0030-drops-9499}, doi = {10.4230/DagSemProc.06431.6}, annote = {Keywords: Distributed XQuery, P2P, DHT} }
Feedback for Dagstuhl Publishing