×

Found 42 Documents (Results 1–42)

On counting perfect matchings in general graphs. (English) Zbl 1507.05051

Bender, Michael A. (ed.) et al., Latin 2018: theoretical informatics. 13th Latin American symposium, Buenos Aires, Argentina, April 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10807, 873-885 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Embedding approximately low-dimensional \(\ell_2^2\) metrics into \(\ell_1\). (English) Zbl 1391.68124

Lal, Akash (ed.) et al., 36th IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2016), Chennai, India, December 13–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-027-9). LIPIcs – Leibniz International Proceedings in Informatics 65, Article 10, 13 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Generic properties of subgroups of free groups and finite presentations. (English) Zbl 1392.20017

Kahrobaei, Delaram (ed.) et al., Algebra and computer science. Joint AMS-EMS-SPM meeting algebra and computer science, Porto, Portugal, June 10–13, 2015. Joint mathematics meetings groups, algorithms, and cryptography, San Antonio, TX, USA, January 10–13, 2015. Joint AMS-Israel Mathematical Union meeting applications of algebra to cryptography, Tel-Aviv, Israel, June 16–19, 2014. Proceedings. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-2303-2/pbk; 978-1-4704-3587-5/ebook). Contemporary Mathematics 677, 1-43 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Terminal embeddings. (English) Zbl 1375.68092

Garg, Naveen (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 18th international workshop on approximation algorithms for combinatorial optimization problems (APPROX 2015) and the 19th international workshop on randomization and computation (RANDOM 2015), Princeton, NJ, USA, August 24–26, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-89-7). LIPIcs – Leibniz International Proceedings in Informatics 40, 242-264 (2015).
PDFBibTeX XMLCite
Full Text: DOI

\(L_{1}\) embeddings of the Heisenberg group and fast estimation of graph isoperimetry. (English) Zbl 1232.46021

Bhatia, Rajendra (ed.) et al., Proceedings of the international congress of mathematicians (ICM 2010), Hyderabad, India, August 19–27, 2010. Vol. III: Invited lectures. Hackensack, NJ: World Scientific; New Delhi: Hindustan Book Agency (ISBN 978-981-4324-33-5/hbk; 978-81-85931-08-3/hbk; 978-981-4324-30-4/set; 978-981-4324-35-9/ebook). 1549-1575 (2011).
PDFBibTeX XMLCite
Full Text: arXiv Link

Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width. (English) Zbl 1333.68288

Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 533-544 (2011).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Approximations for the isoperimetric and spectral profile of graphs and related parameters. (English) Zbl 1293.05214

Proceedings of the 42nd annual ACM symposium on theory of computing, STOC ’10. Cambridge, MA, USA, June 5–8, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-817-9). 631-640 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Proximity algorithms for nearly-doubling spaces. (English) Zbl 1304.68215

Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1–3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 192-204 (2010).
PDFBibTeX XMLCite
Full Text: DOI Link

Randomly coloring planar graphs with fewer colors than the maximum degree. (English) Zbl 1231.05097

STOC’07. Proceedings of the 39th annual ACM symposium on theory of computing, San Diego, CA, USA, June 11–13, 2007. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-631-8). 450-458 (2007).
PDFBibTeX XMLCite
Full Text: arXiv

Path coupling using stopping times. (English) Zbl 1123.68142

Liśkiewicz, Maciej (ed.) et al., Fundamentals of computation theory. 15th international symposium, FCT 2005, Lübeck, Germany, August 17–20, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28193-2/pbk). Lecture Notes in Computer Science 3623, 19-31 (2005).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Divided differences for symmetric functions and alternating higher Bruhat orders. (English. Russian original) Zbl 1006.05061

Russ. Math. Surv. 56, No. 2, 411-413 (2001); translation from Usp. Mat. Nauk 56, No. 2, 217-218 (2001).
PDFBibTeX XMLCite
Full Text: DOI

The Markov chain of colourings. (English) Zbl 1501.05005

Balas, Egon (ed.) et al., Integer programming and combinatorial optimization. 4th international IPCO conference, Copenhagen, Denmark, May 29–31, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 920, 373-387 (1995).
MSC:  05C15 60J10 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field