<?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 (mraginsky)</title>
    <link>https://pinboard.in/u:mraginsky/public/</link>
    <description>recent bookmarks from mraginsky</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://openreview.net/forum?id=FGTDe6EA0B&amp;referrer=%5Bthe%20profile%20of%20Jon%20Kleinberg%5D(%2Fprofile%3Fid%3D~Jon_Kleinberg3)"/>
	<rdf:li rdf:resource="https://horace.io/brrr_intro.html"/>
	<rdf:li rdf:resource="https://dominoweb.draco.res.ibm.com/bbdb25acdb530b5d852574ff004efbec.html"/>
	<rdf:li rdf:resource="https://dominoweb.draco.res.ibm.com/49eae98dc5a21de0852574ff005001c8.html"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2112.08186"/>
	<rdf:li rdf:resource="https://www.microsoft.com/en-us/research/publication/123-platonism-constructivism-computer-proofs-vs-proofs-hand/"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1305.4696"/>
	<rdf:li rdf:resource="http://simons.berkeley.edu/programs/realanalysis2013"/>
	<rdf:li rdf:resource="http://www.cs.cmu.edu/~venkatg/teaching/CStheory-infoage/"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1101.0833"/>
	<rdf:li rdf:resource="http://gilkalai.wordpress.com/2010/11/09/subexponential-lower-bound-for-randomized-pivot-rules/"/>
	<rdf:li rdf:resource="http://userweb.cs.utexas.edu/users/EWD/"/>
	<rdf:li rdf:resource="http://divisbyzero.com/2010/05/27/turings-topological-proof-that-every-written-alphabet-is-finite/"/>
	<rdf:li rdf:resource="http://diva.library.cmu.edu/webapp/simon/"/>
	<rdf:li rdf:resource="http://www.eecs.berkeley.edu/~christos/evol/compevol.htm"/>
	<rdf:li rdf:resource="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.ss/1177011073"/>
	<rdf:li rdf:resource="http://www.cs.cornell.edu/home/kleinber/networks-book/"/>
	<rdf:li rdf:resource="http://www.icsi.berkeley.edu/cgi-bin/pubs/browse.pl?groupid=000006"/>
	<rdf:li rdf:resource="http://people.csail.mit.edu/madhu/papers/gjs-full.pdf"/>
	<rdf:li rdf:resource="http://planning.cs.uiuc.edu/"/>
	<rdf:li rdf:resource="http://terrytao.wordpress.com/2009/08/05/mosers-entropy-compression-argument/"/>
	<rdf:li rdf:resource="http://lambda-the-ultimate.org/node/1038"/>
	<rdf:li rdf:resource="http://blog.computationalcomplexity.org/2009/06/kolmogorov-complexity-proof-of-lov.html"/>
	<rdf:li rdf:resource="http://rjlipton.wordpress.com/2009/06/02/mosers-method-of-bounding-a-program-loop/"/>
	<rdf:li rdf:resource="http://hunch.net/?p=727"/>
	<rdf:li rdf:resource="http://www.cs.yale.edu/homes/spielman/SmoothedAnalysis/"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/0803.0924"/>
	<rdf:li rdf:resource="http://web.mit.edu/andoni/www/LSH/"/>
	<rdf:li rdf:resource="http://www.cs.chalmers.se/~dubhashi/Courses/Fourier/info.html"/>
	<rdf:li rdf:resource="http://focs2007.org/Tutorial_Program.html"/>
	<rdf:li rdf:resource="http://stellar.mit.edu/S/course/18/fa07/18.409/"/>
	<rdf:li rdf:resource="http://simsearch.yury.name/"/>
	<rdf:li rdf:resource="http://www.eecs.berkeley.edu/~wainwrig/"/>
	<rdf:li rdf:resource="http://nerdwisdom.com/"/>
	<rdf:li rdf:resource="http://dcws.stat.cmu.edu/index.html"/>
	<rdf:li rdf:resource="http://geometry.stanford.edu/member/guibas/"/>
	<rdf:li rdf:resource="http://www.cs.cmu.edu/~odonnell/boolean-analysis/"/>
	<rdf:li rdf:resource="http://scienceblogs.com/developingintelligence/2007/03/why_the_brain_is_not_like_a_co.php"/>
	<rdf:li rdf:resource="http://www.menem.com/~ilya/digital_library/full.html"/>
	<rdf:li rdf:resource="http://cse.ucdavis.edu/~dynlearn/"/>
	<rdf:li rdf:resource="http://www.csd.uwo.ca/faculty/akd/akd.html"/>
	<rdf:li rdf:resource="http://www.cs.huji.ac.il/~dolev/"/>
	<rdf:li rdf:resource="http://www.cs.cornell.edu/home/halpern/"/>
	<rdf:li rdf:resource="http://www.cs.berkeley.edu/~christos/"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://openreview.net/forum?id=FGTDe6EA0B&amp;referrer=%5Bthe%20profile%20of%20Jon%20Kleinberg%5D(%2Fprofile%3Fid%3D~Jon_Kleinberg3)">
    <title>Language Generation in the Limit | OpenReview</title>
    <dc:date>2026-04-24T20:43:14+00:00</dc:date>
    <link>https://openreview.net/forum?id=FGTDe6EA0B&amp;referrer=%5Bthe%20profile%20of%20Jon%20Kleinberg%5D(%2Fprofile%3Fid%3D~Jon_Kleinberg3)</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Although current large language models are complex, the most basic specifications of the underlying language generation problem itself are simple to state: given a finite set of training samples from an unknown language, produce valid new strings from the language that don't already appear in the training data. Here we ask what we can conclude about language generation using only this specification, without further assumptions. In particular, suppose that an adversary enumerates the strings of an unknown target language L that is known only to come from one of a possibly infinite list of candidates. A computational agent is trying to learn to generate from this language; we say that the agent generates from in the limit if after some finite point in the enumeration of , the agent is able to produce new elements that come exclusively from and that have not yet been presented by the adversary. Our main result is that there is an agent that is able to generate in the limit for every countable list of candidate languages. This contrasts dramatically with negative results due to Gold and Angluin in a well-studied model of language learning where the goal is to identify an unknown language from samples; the difference between these results suggests that identifying a language is a fundamentally different problem than generating from it.]]></description>
<dc:subject>papers to-read heard-the-talk language generative-models computer-science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:cf4b581b7488/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:heard-the-talk"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:generative-models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://horace.io/brrr_intro.html">
    <title>Making Deep Learning go Brrrr From First Principles</title>
    <dc:date>2026-04-18T21:29:23+00:00</dc:date>
    <link>https://horace.io/brrr_intro.html</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>blogs deep-learning computer-science ai machine-learning GPUs</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:75214b6973a2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:blogs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:deep-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:ai"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:GPUs"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://dominoweb.draco.res.ibm.com/bbdb25acdb530b5d852574ff004efbec.html">
    <title>IBM Research | Technical Paper Search | A Junction between Computer Science and Category Theory, I: Basic Concepts and Examples (Part 2)(Search Reports)</title>
    <dc:date>2023-02-18T17:54:59+00:00</dc:date>
    <link>https://dominoweb.draco.res.ibm.com/bbdb25acdb530b5d852574ff004efbec.html</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[This is the second part of the first report in a series devoted to exploring the interface or "junction" between computer science and category theory. Both benefit from this exploration: computer science by a powerful set of tools and a general methodoloqy providing a rigorous and uniform approach to many of its basic concepts, methods, and questions; and category theory by a nontrivial collection of practical applications and illustrations, plus a number of new problems and results. Our present general purposes are to provide a clear, leisurely, and well-illustrated introduction to the basic lanquage of category theory, and to give introductory formulations of some of the computer science topics, including programs, machines, automata, and languages.

This Part covers graphs and diagrams, and introduces the third key categorial concept, natural transformation. An extended example covering correctness and termination of flow-diagram programs illustrates many of the concepts covered so far in the series.]]></description>
<dc:subject>papers to-read categories computation computer-science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:3f93250df79c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:categories"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://dominoweb.draco.res.ibm.com/49eae98dc5a21de0852574ff005001c8.html">
    <title>IBM Research | Technical Paper Search | A Junction between Computer Science and Category Theory, I: Basic Concepts and Examples (Part 1)(Search Reports)</title>
    <dc:date>2023-02-18T17:54:17+00:00</dc:date>
    <link>https://dominoweb.draco.res.ibm.com/49eae98dc5a21de0852574ff005001c8.html</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[This is the first part of the first report in a series devoted to exploring the interface or "junction" between computer science and category theory. We expect that both will benefit from the exploration: computer science by a powerful set of tools and a general methodology providing a rigorous and uniform approach to many of its basic concepts, methods, and questions; and category theory by a nontrivial collection of practical applications and illustrations, plus a number of new problems and results. Our present general purposes are to provide a clear, leisurely, and well-illustrated introduction to the basic language of category theory, and to give introductory formulations of some of the computer science topics we treat later in greater depth, including machines, automata, and languagea. Later reports will contain the research results which led us to undertake this series.

Section 0 contains a general introduction, a discussion of the special relevance of category theory to computer science, and intuitive interpretations for the key categerical concepts. Section 1 contains a compendium of the background definitions and notation assumed in subsequent sections, especially oriented toward our computer application and category theoretic viewpoint. Section 2 contains the two most basic definitions, of category and functor. There are many examples and frequent intuitive discussions.]]></description>
<dc:subject>papers to-read categories computation computer-science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:9e8fc749775e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:categories"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2112.08186">
    <title>[2112.08186] Planning with Biological Neurons and Synapses</title>
    <dc:date>2022-08-02T15:59:02+00:00</dc:date>
    <link>https://arxiv.org/abs/2112.08186</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[We revisit the planning problem in the blocks world, and we implement a known heuristic for this task. Importantly, our implementation is biologically plausible, in the sense that it is carried out exclusively through the spiking of neurons. Even though much has been accomplished in the blocks world over the past five decades, we believe that this is the first algorithm of its kind. The input is a sequence of symbols encoding an initial set of block stacks as well as a target set, and the output is a sequence of motion commands such as "put the top block in stack 1 on the table". The program is written in the Assembly Calculus, a recently proposed computational framework meant to model computation in the brain by bridging the gap between neural activity and cognitive function. Its elementary objects are assemblies of neurons (stable sets of neurons whose simultaneous firing signifies that the subject is thinking of an object, concept, word, etc.), its commands include project and merge, and its execution model is based on widely accepted tenets of neuroscience. A program in this framework essentially sets up a dynamical system of neurons and synapses that eventually, with high probability, accomplishes the task. The purpose of this work is to establish empirically that reasonably large programs in the Assembly Calculus can execute correctly and reliably; and that rather realistic -- if idealized -- higher cognitive functions, such as planning in the blocks world, can be implemented successfully by such programs. ]]></description>
<dc:subject>papers to-read computer-science neural-networks planning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:ccb71bad8e26/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:planning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.microsoft.com/en-us/research/publication/123-platonism-constructivism-computer-proofs-vs-proofs-hand/">
    <title>Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand - Microsoft Research</title>
    <dc:date>2022-07-28T03:12:21+00:00</dc:date>
    <link>https://www.microsoft.com/en-us/research/publication/123-platonism-constructivism-computer-proofs-vs-proofs-hand/</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[In one of Krylov’s fables, a small dog Moska barks at the elephant who pays no attention whatsoever to Moska. This image comes to my mind when I think of constructive mathematics versus “classical” (that is mainstream) mathematics. In this article, we put a few words into the elephant’s mouth. The idea to write such an article came to me in the summer of 1995 when I came across a fascinating 1917 bet between the constructivist Hermann Weyl and George Polya, a classical mathematician. An English translation of the bet (from German) is found in the article.

Our main objection to the historical constructivism is that it has not been sufficiently constructive. The constructivists have been obsessed with computability and have not paid sufficient attention to the feasibility of algorithms. However, the constructivists’ criticism of classical mathematics has a point. Instead of dismissing constructivism offhand, it makes sense to come up with a positive alternative, an antithesis to historical constructivism. We believe that we have found such an alternative. In fact, it is well known and very popular in computer science: the principle of separating concerns.

[Added in July 2006] The additional part on computer proofs vs. proofs by hand was a result of frustration that many computer scientists would not trust informal mathematical proofs, while many mathematicians would not trust computer proofs. I seemed obvious to me that, on large scale, proving is not only hard but also is imperfect and has engineering character. We need informal proofs and computer proofs and more, e.g. stratification, experimentation.]]></description>
<dc:subject>papers have-read computation constructivism mathematics logic computer-science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:52efdc87eec1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:have-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:constructivism"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:logic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1305.4696">
    <title>[1305.4696] Tight Bounds for Set Disjointness in the Message Passing Model</title>
    <dc:date>2013-10-07T14:16:16+00:00</dc:date>
    <link>http://arxiv.org/abs/1305.4696</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>papers to-read computer-science communication-complexity heard-the-talk</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:33f0dad3eb9c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:communication-complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:heard-the-talk"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://simons.berkeley.edu/programs/realanalysis2013">
    <title>Real Analysis in Computer Science | Simons Institute for the Theory of Computing</title>
    <dc:date>2013-09-23T01:35:55+00:00</dc:date>
    <link>http://simons.berkeley.edu/programs/realanalysis2013</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>conferences probability analysis complexity reference computer-science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:4b220b5aff54/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:conferences"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:probability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:reference"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.cmu.edu/~venkatg/teaching/CStheory-infoage/">
    <title>Computer Science Theory for the Information Age, Spring 2012.</title>
    <dc:date>2012-12-19T00:40:46+00:00</dc:date>
    <link>http://www.cs.cmu.edu/~venkatg/teaching/CStheory-infoage/</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Includes draft of a book by John Hopcroft and Ravi Kannan that covers high-dimensional geometry (Johnson-Lindenstrauss and all that), SVD, random graphs, Markov chains, algorithms for "big data", etc.]]></description>
<dc:subject>lecture-notes computer-science machine-learning algorithms probability</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:3ce38d78f419/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:lecture-notes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:probability"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1101.0833">
    <title>[1101.0833] Dynamical systems, simulation, abstract computation</title>
    <dc:date>2011-01-06T16:03:57+00:00</dc:date>
    <link>http://arxiv.org/abs/1101.0833</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[""We survey an area of recent development, relating dynamics to theoretical computer science. We discuss the theoretical limits of simulation and computation of interesting quantities in dynamical systems. We will focus on central objects of the theory of dynamics, as invariant measures and invariant sets, showing that even if they can be computed with arbitrary precision in many interesting cases, there exists some cases in which they can not. We also explain how it is possible to compute the speed of convergence of ergodic averages (when the system is known exactly) and how this entails the computation of arbitrarily good approximations of points of the space having typical statistical behaviour (a sort of constructive version of the pointwise ergodic theorem).""
]]></description>
<dc:subject>papers to-read ergodic-theory dynamical-systems complexity computer-science algorithms simulation</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:a0efda18694f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:ergodic-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:simulation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://gilkalai.wordpress.com/2010/11/09/subexponential-lower-bound-for-randomized-pivot-rules/">
    <title>Subexponential Lower Bound for Randomized Pivot Rules! | Combinatorics and more</title>
    <dc:date>2010-11-10T00:52:21+00:00</dc:date>
    <link>http://gilkalai.wordpress.com/2010/11/09/subexponential-lower-bound-for-randomized-pivot-rules/</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA["Oliver Friedman, Thomas Dueholm Hansen, and Uri Zwick have managed to prove subexponential lower bounds of the form  for ... two basic randomized pivot rules for the simplex algorithm! This is the first result of its kind and deciding if this is possible was an open problem for several decades." And they do it using MDPs!
]]></description>
<dc:subject>papers to-read computer-science computation optimization linear-programming dynamic-programming Markov-decision-processes lower-bounds</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:d6a34feb3e04/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:linear-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamic-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:Markov-decision-processes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:lower-bounds"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://userweb.cs.utexas.edu/users/EWD/">
    <title>E.W.Dijkstra Archive: Home page</title>
    <dc:date>2010-07-29T01:58:39+00:00</dc:date>
    <link>http://userweb.cs.utexas.edu/users/EWD/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>algorithms computer-science mathematics people reference software papers logic proto-bloggers</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:a82b8cf19273/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:people"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:reference"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:software"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:logic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:proto-bloggers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://divisbyzero.com/2010/05/27/turings-topological-proof-that-every-written-alphabet-is-finite/">
    <title>Turing’s topological proof that every written alphabet is finite (Dave Richeson)</title>
    <dc:date>2010-06-16T19:37:46+00:00</dc:date>
    <link>http://divisbyzero.com/2010/05/27/turings-topological-proof-that-every-written-alphabet-is-finite/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>blogs computer-science complexity topology via:arsyed</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:700eb8cda466/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:blogs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:topology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:via:arsyed"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://diva.library.cmu.edu/webapp/simon/">
    <title>DIVA2: Search: Herbert Simon</title>
    <dc:date>2010-04-29T23:32:05+00:00</dc:date>
    <link>http://diva.library.cmu.edu/webapp/simon/</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[The Herbert Simon collection at the CMU library
]]></description>
<dc:subject>papers reference economics organizations causality AI complexity complex-systems computer-science</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:8ebf911c5e61/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:reference"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:economics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:organizations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:causality"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:AI"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complex-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.eecs.berkeley.edu/~christos/evol/compevol.htm">
    <title>Computational Aspects of Evolution</title>
    <dc:date>2010-01-24T15:23:37+00:00</dc:date>
    <link>http://www.eecs.berkeley.edu/~christos/evol/compevol.htm</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[A course taught by Christos Papadimitriou
]]></description>
<dc:subject>evolution complexity computation computer-science optimization lecture-notes algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:fd9dd4e3aecb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:evolution"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:lecture-notes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.ss/1177011073">
    <title>Statistical Science</title>
    <dc:date>2009-12-04T05:10:54+00:00</dc:date>
    <link>http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.ss/1177011073</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Issue on Interface of Probability and Algorithms
]]></description>
<dc:subject>papers to-read statistics probability optimization algorithms computer-science complexity</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:32c892ac0d5c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:probability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.cornell.edu/home/kleinber/networks-book/">
    <title>Networks, Crowds, and Markets: A Book by David Easley and Jon Kleinberg</title>
    <dc:date>2009-11-08T05:35:37+00:00</dc:date>
    <link>http://www.cs.cornell.edu/home/kleinber/networks-book/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>economics books complexity game-theory download computer-science Internet network-data-analysis social-networks</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:9d50a527ab5a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:economics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:books"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:game-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:download"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:Internet"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:network-data-analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:social-networks"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.icsi.berkeley.edu/cgi-bin/pubs/browse.pl?groupid=000006">
    <title>International Computer Science Institute | Publications: 2009</title>
    <dc:date>2009-10-09T02:40:29+00:00</dc:date>
    <link>http://www.icsi.berkeley.edu/cgi-bin/pubs/browse.pl?groupid=000006</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[ICSI tech repots
]]></description>
<dc:subject>papers complexity computer-science computation algorithms AI statistics</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:f54c33ffdcb7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:AI"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:statistics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://people.csail.mit.edu/madhu/papers/gjs-full.pdf">
    <title>Goldreich, Juba, and Sudan &quot;A Theory of Goal-Oriented Communication&quot;</title>
    <dc:date>2009-10-09T01:00:36+00:00</dc:date>
    <link>http://people.csail.mit.edu/madhu/papers/gjs-full.pdf</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>via:arthegall papers have-read distributed-systems computer-science complexity computation communication filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:33a9f3b91b94/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:via:arthegall"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:have-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:distributed-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:communication"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://planning.cs.uiuc.edu/">
    <title>Planning Algorithms / Motion Planning</title>
    <dc:date>2009-10-08T03:38:27+00:00</dc:date>
    <link>http://planning.cs.uiuc.edu/</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Steven M. LaValle
]]></description>
<dc:subject>books control-theory computer-science computer-vision complexity sensor-networks robotics AI</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:c55ec68c13fb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:books"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-vision"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:sensor-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:robotics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:AI"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://terrytao.wordpress.com/2009/08/05/mosers-entropy-compression-argument/">
    <title>Moser’s entropy compression argument</title>
    <dc:date>2009-08-11T16:47:31+00:00</dc:date>
    <link>http://terrytao.wordpress.com/2009/08/05/mosers-entropy-compression-argument/</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Terry Tao explains the recent paper by Robin Moser.
]]></description>
<dc:subject>probability information-theory complexity computer-science mathematics computation</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:530f864d560b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:probability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:information-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://lambda-the-ultimate.org/node/1038">
    <title>The Church-Turing Thesis: Breaking the Myth | Lambda the Ultimate</title>
    <dc:date>2009-07-17T04:12:24+00:00</dc:date>
    <link>http://lambda-the-ultimate.org/node/1038</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA["This paper seeks to explode the myth that Turing Machines (TM) are the universal model for all computation."
]]></description>
<dc:subject>papers blogs to-read complexity computer-science interesting</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:ea52f986048d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:blogs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:interesting"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://blog.computationalcomplexity.org/2009/06/kolmogorov-complexity-proof-of-lov.html">
    <title>Computational Complexity: A Kolmogorov Complexity Proof of the Lovász Local Lemma</title>
    <dc:date>2009-06-06T05:59:48+00:00</dc:date>
    <link>http://blog.computationalcomplexity.org/2009/06/kolmogorov-complexity-proof-of-lov.html</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>information-theory computer-science complexity algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:14ea8042c30c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:information-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://rjlipton.wordpress.com/2009/06/02/mosers-method-of-bounding-a-program-loop/">
    <title>Moser’s Method of Bounding a Program Loop « Gödel’s Lost Letter and P=NP</title>
    <dc:date>2009-06-03T03:58:42+00:00</dc:date>
    <link>http://rjlipton.wordpress.com/2009/06/02/mosers-method-of-bounding-a-program-loop/</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA["The main point is this: an information theory bound yields an upper bound on the running time of a computational process."
]]></description>
<dc:subject>information-theory computer-science complexity interesting</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:50977bbc8944/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:information-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:interesting"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://hunch.net/?p=727">
    <title>Machine Learning (Theory) » Computability in Artificial Intelligence</title>
    <dc:date>2009-05-09T03:58:13+00:00</dc:date>
    <link>http://hunch.net/?p=727</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA["Let me show by analogy why limiting research to computational questions is bad for any field. Except in computer science, computational aspects play little role in the development of fundamental theories: Consider e.g. set theory with axiom of choice, foundations of logic, exact/full minimax for zero-sum games, quantum (field) theory, string theory, … Indeed, at least in physics, every new fundamental theory seems to be less computable than previous ones."
]]></description>
<dc:subject>blogs have-read science complexity computer-science computation philosophy epistemology AI learning-theory</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:26ed42cbf162/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:blogs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:have-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:philosophy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:epistemology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:AI"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:learning-theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.yale.edu/homes/spielman/SmoothedAnalysis/">
    <title>Research Papers on Smoothed Analysis</title>
    <dc:date>2008-08-24T17:28:49+00:00</dc:date>
    <link>http://www.cs.yale.edu/homes/spielman/SmoothedAnalysis/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>papers research algorithms complexity computer-science reference optimization</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:8ba1a1b86ecf/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:reference"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/0803.0924">
    <title>[0803.0924] What Can We Learn Privately?</title>
    <dc:date>2008-03-09T23:18:45+00:00</dc:date>
    <link>http://arxiv.org/abs/0803.0924</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>algorithms crypto learning-theory computer-science complexity papers to-read machine-learning</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:c5e6a9b2708a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:learning-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://web.mit.edu/andoni/www/LSH/">
    <title>Locality Sensitive Hashing (LSH) Home Page</title>
    <dc:date>2008-02-25T01:30:34+00:00</dc:date>
    <link>http://web.mit.edu/andoni/www/LSH/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>computer-science data-mining compressed-sensing algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:f487b30fd220/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:data-mining"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:compressed-sensing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.chalmers.se/~dubhashi/Courses/Fourier/info.html">
    <title>Fourier Analysis in Combinatorics, Probability and Computing</title>
    <dc:date>2008-01-15T19:50:47+00:00</dc:date>
    <link>http://www.cs.chalmers.se/~dubhashi/Courses/Fourier/info.html</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>lecture-notes mathematics computer-science machine-learning learning-theory complexity</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:b4cf4901ea50/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:lecture-notes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:learning-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://focs2007.org/Tutorial_Program.html">
    <title>Tutorial schedule</title>
    <dc:date>2007-11-06T04:56:03+00:00</dc:date>
    <link>http://focs2007.org/Tutorial_Program.html</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[FOCS 2008 tutorials (Terry Tao on randomness in combinatorics; Dan Boneh on crypto; Dan Spielman on graph spectra)
]]></description>
<dc:subject>lecture-notes crypto computer-science mathematics</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:e408265faf86/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:lecture-notes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:mathematics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://stellar.mit.edu/S/course/18/fa07/18.409/">
    <title>18.409 Class Home</title>
    <dc:date>2007-10-10T22:04:56+00:00</dc:date>
    <link>http://stellar.mit.edu/S/course/18/fa07/18.409/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>lecture-notes computer-science algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:01a06232e8fb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:lecture-notes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://simsearch.yury.name/">
    <title>The Homepage of Nearest Neighbors and Similarity Search</title>
    <dc:date>2007-09-27T17:58:57+00:00</dc:date>
    <link>http://simsearch.yury.name/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>computer-science complexity data-mining learning-theory machine-learning optimization research reference</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:ed8eb2a92b96/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:data-mining"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:learning-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:reference"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.eecs.berkeley.edu/~wainwrig/">
    <title>Martin Wainwright's home page</title>
    <dc:date>2007-09-09T20:06:54+00:00</dc:date>
    <link>http://www.eecs.berkeley.edu/~wainwrig/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>people research statistics coding-theory computer-science communications learning-theory information-theory homepages machine-learning signal-processing sensor-networks</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:bd31ba4b8664/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:people"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:coding-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:communications"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:learning-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:information-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:homepages"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:signal-processing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:sensor-networks"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://nerdwisdom.com/">
    <title>Nerd Wisdom</title>
    <dc:date>2007-08-30T22:24:03+00:00</dc:date>
    <link>http://nerdwisdom.com/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>AI blogs computer-science learning-theory machine-learning game-theory signal-processing geekery data-mining complexity information-theory statistics research</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:aa6d7afd4f62/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:AI"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:blogs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:learning-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:game-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:signal-processing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:geekery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:data-mining"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:information-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:research"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://dcws.stat.cmu.edu/index.html">
    <title>DCWHome</title>
    <dc:date>2007-08-27T00:33:51+00:00</dc:date>
    <link>http://dcws.stat.cmu.edu/index.html</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>conferences computer-science interesting forensics machine-learning statistics research security</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:830b014e1277/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:conferences"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:forensics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:security"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://geometry.stanford.edu/member/guibas/">
    <title>Guibas Lab</title>
    <dc:date>2007-08-17T15:19:33+00:00</dc:date>
    <link>http://geometry.stanford.edu/member/guibas/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>computer-science sensor-networks research papers people homepages signal-processing</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:9d5e3160319a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:sensor-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:people"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:homepages"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:signal-processing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.cmu.edu/~odonnell/boolean-analysis/">
    <title>15-859S: Analysis of Boolean Functions</title>
    <dc:date>2007-08-17T13:32:02+00:00</dc:date>
    <link>http://www.cs.cmu.edu/~odonnell/boolean-analysis/</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Lecture notes by Ryan O'Donnell (CMU)
]]></description>
<dc:subject>complexity computer-science lecture-notes mathematics machine-learning</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:5d42298bdeb1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:lecture-notes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://scienceblogs.com/developingintelligence/2007/03/why_the_brain_is_not_like_a_co.php">
    <title>Developing Intelligence : 10 Important Differences Between Brains and Computers</title>
    <dc:date>2007-04-02T03:41:40+00:00</dc:date>
    <link>http://scienceblogs.com/developingintelligence/2007/03/why_the_brain_is_not_like_a_co.php</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>biology neuroscience philosophy blogs cybernetics computer-science</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:767dbb713c64/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neuroscience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:philosophy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:blogs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:cybernetics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.menem.com/~ilya/digital_library/full.html">
    <title>Ilya Nemenman's Digital Library</title>
    <dc:date>2007-03-31T16:46:21+00:00</dc:date>
    <link>http://www.menem.com/~ilya/digital_library/full.html</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>complexity information-theory research reviews AI computer-science learning-theory probability papers neuroscience mathematics machine-learning statistics</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:891b521988bc/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:information-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:reviews"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:AI"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:learning-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:probability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:neuroscience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:statistics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://cse.ucdavis.edu/~dynlearn/">
    <title>Dynamics of Learning Project - The Santa Fe Institute</title>
    <dc:date>2006-12-19T04:23:39+00:00</dc:date>
    <link>http://cse.ucdavis.edu/~dynlearn/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>AI complexity computer-science learning-theory machine-learning</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:1884e731f881/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:AI"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:learning-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:machine-learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.csd.uwo.ca/faculty/akd/akd.html">
    <title>A.K. Dewdney's Home Page</title>
    <dc:date>2006-09-26T16:58:20+00:00</dc:date>
    <link>http://www.csd.uwo.ca/faculty/akd/akd.html</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>people speculation psychoceramics computer-science polemics papers homepages research subversive</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:cd5b35c26265/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:people"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:speculation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:psychoceramics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:polemics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:homepages"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:subversive"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.huji.ac.il/~dolev/">
    <title>Prof. Danny Dolev</title>
    <dc:date>2006-05-03T14:28:27+00:00</dc:date>
    <link>http://www.cs.huji.ac.il/~dolev/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>people homepages research papers computer-science game-theory fault-tolerance distributed-computing</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:dabc2729e480/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:people"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:homepages"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:game-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:fault-tolerance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:distributed-computing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.cornell.edu/home/halpern/">
    <title>Joe Halpern's Home Page</title>
    <dc:date>2006-05-03T14:24:24+00:00</dc:date>
    <link>http://www.cs.cornell.edu/home/halpern/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>people homepages computer-science papers game-theory</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:538dab46e459/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:people"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:homepages"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:game-theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.berkeley.edu/~christos/">
    <title>Papadimitriou's home page</title>
    <dc:date>2006-05-02T19:52:20+00:00</dc:date>
    <link>http://www.cs.berkeley.edu/~christos/</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>papers research people homepages computer-science complexity game-theory</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:557fd38381ef/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:people"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:homepages"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:game-theory"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>