Skip to main content

The FUNnest Talks That belong to FUN (Abstract)

  • Conference paper
Fun with Algorithms (FUN 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6099))

Included in the following conference series:

  • 1515 Accesses

Abstract

This talk presents the author’s personal favorites of fun talks from algorithms and complexity. Not all of these were presented at FUN, but definitely would have generated fun at FUN.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Raghavan, P. (2010). The FUNnest Talks That belong to FUN (Abstract). In: Boldi, P., Gargano, L. (eds) Fun with Algorithms. FUN 2010. Lecture Notes in Computer Science, vol 6099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13122-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13122-6_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13121-9

  • Online ISBN: 978-3-642-13122-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics