Search Results

Documents authored by Alvarez, R. Michael

Found 2 Possible Name Variants:

Alvarez, R. Michael

Document
DOI: 10.4230/DagRep.1.7.36
Verifiable Elections and the Public (Dagstuhl Seminar 11281)

Authors: R. Michael Alvarez, Josh Benaloh, Alon Rosen, and Peter Y. A. Ryan

Published in: Dagstuhl Reports, Volume 1, Issue 7 (2011)

Abstract
This report documents the program of Dagstuhl Seminar 11281 ``Verifiable Elections and the Public''. This seminar brought together leading researchers from computer and social science, policymakers, and representatives of industry to present new research, develop new interdisciplinary approaches for studying election technologies, and to determine ways to bridge the gap between research and practice.
Cite as

R. Michael Alvarez, Josh Benaloh, Alon Rosen, and Peter Y. A. Ryan. Verifiable Elections and the Public (Dagstuhl Seminar 11281). In Dagstuhl Reports, Volume 1, Issue 7, pp. 36-52, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@Article{alvarez_et_al:DagRep.1.7.36,
  author =	{Alvarez, R. Michael and Benaloh, Josh and Rosen, Alon and Ryan, Peter Y. A.},
  title =	{{Verifiable Elections and the Public (Dagstuhl Seminar 11281)}},
  pages =	{36--52},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{7},
  editor =	{Alvarez, R. Michael and Benaloh, Josh and Rosen, Alon and Ryan, Peter Y. A.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.7.36},
  URN =		{urn:nbn:de:0030-drops-33086},
  doi =		{10.4230/DagRep.1.7.36},
  annote =	{Keywords: Electronic voting, Internet voting, voter verification, verifiable elections}
}

Alvarez, Victor

Document
DOI: 10.4230/LIPIcs.SoCG.2016.7
An Improved Lower Bound on the Minimum Number of Triangulations

Authors: Oswin Aichholzer, Victor Alvarez, Thomas Hackl, Alexander Pilz, Bettina Speckmann, and Birgit Vogtenhuber

Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)

Abstract
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points in the plane have been intensively studied in recent years. For most classes of geometric graphs it is now known that point sets in convex position minimize their number. However, it is still unclear which point sets minimize the number of geometric triangulations; the so-called double circles are conjectured to be the minimizing sets. In this paper we prove that any set of n points in general position in the plane has at least Omega(2.631^n) geometric triangulations. Our result improves the previously best general lower bound of Omega(2.43^n) and also covers the previously best lower bound of Omega(2.63^n) for a fixed number of extreme points. We achieve our bound by showing and combining several new results, which are of independent interest: (1) Adding a point on the second convex layer of a given point set (of 7 or more points) at least doubles the number of triangulations. (2) Generalized configurations of points that minimize the number of triangulations have at most n/2 points on their convex hull. (3) We provide tight lower bounds for the number of triangulations of point sets with up to 15 points. These bounds further support the double circle conjecture.
Cite as

Oswin Aichholzer, Victor Alvarez, Thomas Hackl, Alexander Pilz, Bettina Speckmann, and Birgit Vogtenhuber. An Improved Lower Bound on the Minimum Number of Triangulations. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 7:1-7:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{aichholzer_et_al:LIPIcs.SoCG.2016.7,
  author =	{Aichholzer, Oswin and Alvarez, Victor and Hackl, Thomas and Pilz, Alexander and Speckmann, Bettina and Vogtenhuber, Birgit},
  title =	{{An Improved Lower Bound on the Minimum Number of Triangulations}},
  booktitle =	{32nd International Symposium on Computational Geometry (SoCG 2016)},
  pages =	{7:1--7: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.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.7},
  URN =		{urn:nbn:de:0030-drops-58993},
  doi =		{10.4230/LIPIcs.SoCG.2016.7},
  annote =	{Keywords: Combinatorial geometry, Order types, Triangulations}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact