• Sorted by Date • Classified by Research Category • Classified by Author Last Name •
Gary L. Miller, Noel J. Walkington, and Alex L. Wang. Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019), pp. 8:1–8:19, Leibniz International Proceedings in Informatics (LIPIcs) 145, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2019.
[PDF]506.9kB [gzipped postscript] [postscript] [HTML]
(unavailable)
@InProceedings{MillerHardy19,
author = {Gary L. Miller and Noel J. Walkington and Alex L. Wang},
title = {{Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {8:1--8:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Dimitris Achlioptas and L{\'a}szl{\'o} A. V{\'e}gh},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11223},
URN = {urn:nbn:de:0030-drops-112236},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.8},
annote = {Keywords: Hardy, Muckenhoupt, Laplacian, eigenvalue, effective resistance}
}
Generated by bib2html.pl (written by Patrick Riley ) on Thu Mar 11, 2021 11:20:21