<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (shivak)</title>
    <link>https://pinboard.in/u:shivak/public/</link>
    <description>recent bookmarks from shivak</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="http://arxiv.org/abs/1112.4988"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/0911.2077"/>
	<rdf:li rdf:resource="http://onionesquereality.wordpress.com/2012/01/07/importing-the-szemeredi-regularity-lemma-into-machine-learning/"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1111.3732"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1105.2942"/>
	<rdf:li rdf:resource="http://www.newton.ac.uk/programmes/DAN/seminars/033110001.html"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1012.1240"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/0809.2477"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1011.4310"/>
	<rdf:li rdf:resource="http://www.combinatorics.org/Volume_12/Abstracts/v12i1r3.html"/>
	<rdf:li rdf:resource="http://mybiasedcoin.blogspot.com/2010/05/aldousdiaconis-longest-increasing.html"/>
	<rdf:li rdf:resource="http://www.wisdom.weizmann.ac.il/~oded/test.html"/>
	<rdf:li rdf:resource="http://algo.inria.fr/flajolet/Publications/book.pdf"/>
	<rdf:li rdf:resource="http://rjlipton.wordpress.com/2010/03/03/beating-bellman-for-the-knapsack-problem/"/>
	<rdf:li rdf:resource="http://www.math.upenn.edu/~wilf/AeqB.html"/>
	<rdf:li rdf:resource="http://aofa2009.greyc.fr/"/>
	<rdf:li rdf:resource="http://www.math.tamu.edu/~grigoris/ConcentrationWeekHome.html"/>
	<rdf:li rdf:resource="http://eprint.iacr.org/2009/186"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="http://arxiv.org/abs/1112.4988">
    <title>On a conjecture concerning the sum of independent Rademacher random variables</title>
    <dc:date>2012-01-10T17:53:03+00:00</dc:date>
    <link>http://arxiv.org/abs/1112.4988</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["It is shown that at least 50% of the probability mass of a sum of independent Rademacher random variables is within one standard deviation from its mean. This lower bound is sharp, it is much better than for instance the bound that can be obtained from application of the Chebishev inequality..."]]></description>
<dc:subject>probability combinatorics papers</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:shivak/b:fbda1e8f04b9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:probability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/0911.2077">
    <title>Central Binomial Tail Bounds</title>
    <dc:date>2012-01-10T17:51:05+00:00</dc:date>
    <link>http://arxiv.org/abs/0911.2077</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["An alternate form for the binomial tail is presented, which leads to a variety of bounds for the central tail. A few can be weakened into the corresponding Chernoff and Slud bounds, which not only demonstrates the quality of the presented bounds, but also provides alternate proofs for the classical bounds."]]></description>
<dc:subject>probability combinatorics papers</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:shivak/b:83c6619e6659/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:probability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://onionesquereality.wordpress.com/2012/01/07/importing-the-szemeredi-regularity-lemma-into-machine-learning/">
    <title>Importing the Szemerédi Regularity Lemma into Machine Learning « Onionesque Reality</title>
    <dc:date>2012-01-10T17:28:33+00:00</dc:date>
    <link>http://onionesquereality.wordpress.com/2012/01/07/importing-the-szemeredi-regularity-lemma-into-machine-learning/</link>
    <dc:creator>shivak</dc:creator><dc:subject>combinatorics clustering</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:shivak/b:4ed4b87489d8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:clustering"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1111.3732">
    <title>A probabilistic approach to some binomial identities</title>
    <dc:date>2011-11-17T09:19:20+00:00</dc:date>
    <link>http://arxiv.org/abs/1111.3732</link>
    <dc:creator>shivak</dc:creator><dc:subject>probability combinatorics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:shivak/b:ce03b4413713/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:probability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1105.2942">
    <title>Invitation to Algorithmic Uses of Inclusion-Exclusion</title>
    <dc:date>2011-11-01T18:59:44+00:00</dc:date>
    <link>http://arxiv.org/abs/1105.2942</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["There are as many odd-sized as even-sized subsets sandwiched between two different sets."]]></description>
<dc:subject>combinatorics surveys</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:shivak/b:ad55d43d78ff/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:surveys"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.newton.ac.uk/programmes/DAN/seminars/033110001.html">
    <title>Proving theorems inside sparse random sets</title>
    <dc:date>2011-06-09T18:00:47+00:00</dc:date>
    <link>http://www.newton.ac.uk/programmes/DAN/seminars/033110001.html</link>
    <dc:creator>shivak</dc:creator><dc:subject>sparsity combinatorics videos lectures to_view</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:24e4d4f1a655/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:sparsity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:videos"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:lectures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:to_view"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1012.1240">
    <title>Tight lower bounds for the size of epsilon-nets</title>
    <dc:date>2010-12-07T02:24:25+00:00</dc:date>
    <link>http://arxiv.org/abs/1012.1240</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Obsoletes Noga's recent result.
]]></description>
<dc:subject>capacity_control combinatorics papers</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:7313ff1d8a3c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:capacity_control"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/0809.2477">
    <title>Two new Probability inequalities and Concentration Results</title>
    <dc:date>2010-11-29T16:10:54+00:00</dc:date>
    <link>http://arxiv.org/abs/0809.2477</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["The usual Azuma's inequality assumes absolute bounds on the Martingale differences. This is often too pessimistic, but seems inherently required in the usual moment-generating function method. We prove a new general inequality based on bounds on moments of Martingale differences rather than absolute bounds; while the method used is elementary, it is quite different from the m-g f method."
]]></description>
<dc:subject>deviation_inequalities combinatorics papers</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:ef9f93a6d8ce/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:deviation_inequalities"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1011.4310">
    <title>Combinatorial theorems in sparse random sets</title>
    <dc:date>2010-11-23T18:49:36+00:00</dc:date>
    <link>http://arxiv.org/abs/1011.4310</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["We develop a new technique that allows us to show in a unified way that many well-known combinatorial theorems, including Tur\'an's theorem, Szemer\'edi's theorem and Ramsey's theorem, hold almost surely inside sparse random sets."
]]></description>
<dc:subject>combinatorics sparsity papers</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:28c341659d52/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:sparsity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.combinatorics.org/Volume_12/Abstracts/v12i1r3.html">
    <title>Optimal decision trees on simplicial complexes</title>
    <dc:date>2010-06-20T20:14:57+00:00</dc:date>
    <link>http://www.combinatorics.org/Volume_12/Abstracts/v12i1r3.html</link>
    <dc:creator>shivak</dc:creator><dc:subject>combinatorics evasiveness decision_trees papers</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:5a4a3ad01e6c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:evasiveness"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:decision_trees"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:papers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://mybiasedcoin.blogspot.com/2010/05/aldousdiaconis-longest-increasing.html">
    <title>Aldous/Diaconis: Longest Increasing Subsequences</title>
    <dc:date>2010-05-11T05:52:28+00:00</dc:date>
    <link>http://mybiasedcoin.blogspot.com/2010/05/aldousdiaconis-longest-increasing.html</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[The techniques taught early on in "Probability Theory and Combinatorial Optimization" apparently go quite far.
]]></description>
<dc:subject>teaching combinatorics</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:74f91cff7dda/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:teaching"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.wisdom.weizmann.ac.il/~oded/test.html">
    <title>Combinatorial Property Testing: Surveys and Works</title>
    <dc:date>2010-04-06T11:21:49+00:00</dc:date>
    <link>http://www.wisdom.weizmann.ac.il/~oded/test.html</link>
    <dc:creator>shivak</dc:creator><description><![CDATA["Most of the works mentioned below focus on combinatorial properties, and specifically on graph properties. The two standard representations of graphs - by adjacency matrix and by incidence lists - yield two different models for testing graph properties. In the first model graphs, most appropriate for dense graphs, distance between N-vertex graphs is measured as the fraction of edges on which the graphs disagree over N^2. In the second model graphs, most appropriate for bounded-degree graphs, distance between N-vertex d-degree graphs is measured as the fraction of edges on which the graphs disagree over dN."
]]></description>
<dc:subject>surveys property_testing graph_theory combinatorics goldreich oded</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:8e15bf1fc7b6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:surveys"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:property_testing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:graph_theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:goldreich"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:oded"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://algo.inria.fr/flajolet/Publications/book.pdf">
    <title>Analytic Combinatorics</title>
    <dc:date>2010-03-24T03:27:00+00:00</dc:date>
    <link>http://algo.inria.fr/flajolet/Publications/book.pdf</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Free online book by an upcoming seminar speaker. "We develop in about 800 pages the basics of asymptotic enumeration and the analysis of random combinatorial structures through an approach that revolves around generating functions and complex analysis."
]]></description>
<dc:subject>books combinatorics analysis mathematics generating_functions flajolet phillipe sedgewick robert filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:a69aae76d4cd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:books"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:generating_functions"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:flajolet"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:phillipe"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:sedgewick"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:robert"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://rjlipton.wordpress.com/2010/03/03/beating-bellman-for-the-knapsack-problem/">
    <title>Beating Bellman for The Knapsack Problem</title>
    <dc:date>2010-03-03T16:24:12+00:00</dc:date>
    <link>http://rjlipton.wordpress.com/2010/03/03/beating-bellman-for-the-knapsack-problem/</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[The coefficient extraction method and its predecessor the constant term method.
]]></description>
<dc:subject>combinatorics algorithms proof_techniques lokshtanov daniel lipton richard</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:49006895ea74/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:proof_techniques"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:lokshtanov"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:daniel"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:lipton"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:richard"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.math.upenn.edu/~wilf/AeqB.html">
    <title>A=B</title>
    <dc:date>2010-02-23T07:43:07+00:00</dc:date>
    <link>http://www.math.upenn.edu/~wilf/AeqB.html</link>
    <dc:creator>shivak</dc:creator><dc:subject>combinatorics computer_algebra proofs books</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:9adeff74a073/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:computer_algebra"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:proofs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:books"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://aofa2009.greyc.fr/">
    <title>Analysis of Algorithms 2009</title>
    <dc:date>2009-07-02T03:10:25+00:00</dc:date>
    <link>http://aofa2009.greyc.fr/</link>
    <dc:creator>shivak</dc:creator><dc:subject>conferences algorithms combinatorics data_structures theoretical_computer_science</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:51fffae2675b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:conferences"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:data_structures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:theoretical_computer_science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.math.tamu.edu/~grigoris/ConcentrationWeekHome.html">
    <title>Probability in Asymptotic Geometry</title>
    <dc:date>2009-06-20T02:42:38+00:00</dc:date>
    <link>http://www.math.tamu.edu/~grigoris/ConcentrationWeekHome.html</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Workshop at Texas A&M.
]]></description>
<dc:subject>probability geometry combinatorics</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:7c24b57afc36/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:probability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://eprint.iacr.org/2009/186">
    <title>Statistics of Random Permutations and the Cryptanalysis of Periodic Block Cipher</title>
    <dc:date>2009-05-03T07:29:06+00:00</dc:date>
    <link>http://eprint.iacr.org/2009/186</link>
    <dc:creator>shivak</dc:creator><description><![CDATA[Ordinary and exponential generating functions are useful for determining the properties of random permutations.
]]></description>
<dc:subject>combinatorics randomness generating_functions courtois nicolas bard gregory_v ault_shaun</dc:subject>
<dc:identifier>https://pinboard.in/u:shivak/b:2faadc0a78fd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:randomness"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:generating_functions"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:courtois"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:nicolas"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:bard"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:gregory_v"/>
	<rdf:li rdf:resource="https://pinboard.in/u:shivak/t:ault_shaun"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>