<?xml version="1.0" encoding="UTF-8"?>
<ListBucketResult xmlns="http://s3.amazonaws.com/doc/2006-03-01/"><Name>zero-bias-papers</Name><Prefix></Prefix><Marker></Marker><MaxKeys>1000</MaxKeys><IsTruncated>false</IsTruncated><Contents><Key>2014 - A Practical Wait-Free Simulation for Lock-Free Data Structures.pdf</Key><LastModified>2019-07-02T21:23:31.000Z</LastModified><ETag>&quot;150bc39753123530620c8f7653b2b448&quot;</ETag><Size>551476</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>A Space-Efficient Algorithm for Finding Strongly Connected Components.pdf</Key><LastModified>2019-07-02T21:23:36.000Z</LastModified><ETag>&quot;8082266b2fbbce96fbcc7176fb6e2b82&quot;</ETag><Size>276935</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>A graph model of data and workflow provenance.pdf</Key><LastModified>2019-07-02T21:23:29.000Z</LastModified><ETag>&quot;51bfb26d2f6aa1f54b3fd804196d881f&quot;</ETag><Size>446676</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Aesthetics of Science Fiction Spaceship Design.pdf</Key><LastModified>2019-07-02T21:23:29.000Z</LastModified><ETag>&quot;0c54d14216c3399f463e31a5c17a2b68&quot;</ETag><Size>29451191</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Algebraic Effects for Functional Programming.pdf</Key><LastModified>2020-04-17T20:00:17.000Z</LastModified><ETag>&quot;bf8bde8bc86e46d58d51993552312268&quot;</ETag><Size>193052</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Algorithhms 4th Edition by Robert Sedgewick, Kevin Wayne.pdf</Key><LastModified>2019-07-02T21:23:29.000Z</LastModified><ETag>&quot;b892ee61637bf6d1da64c5e29578a7b0&quot;</ETag><Size>13474772</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>An Experimental Analysis of Self-Adjusting Computation.pdf</Key><LastModified>2019-07-02T21:23:33.000Z</LastModified><ETag>&quot;350fd27256687d70bc793328ca6d1881&quot;</ETag><Size>1091723</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>An Improved Algorithm for Matching Large Graphs.pdf</Key><LastModified>2019-07-02T21:23:36.000Z</LastModified><ETag>&quot;8c7893b55d4c543c8fbbc13b8112192d&quot;</ETag><Size>55281</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases.pdf</Key><LastModified>2019-07-02T21:23:33.000Z</LastModified><ETag>&quot;9ba0e30d1c779e32da26089ea3e75523&quot;</ETag><Size>394951</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Backtracking, Interleaving, and Terminating Monad Transformers.pdf</Key><LastModified>2019-07-02T21:23:35.000Z</LastModified><ETag>&quot;79f8e328c4e318a79be374503f05d140&quot;</ETag><Size>189935</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Cross Reduction for Orthogonal Circuit Visualization.pdf</Key><LastModified>2020-04-17T20:00:27.000Z</LastModified><ETag>&quot;d2b2c041d75e6539cd80950a084dc9bb&quot;</ETag><Size>172299</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Designing_Data_Intensive_Applications_The_Big_Ideas_Behind_Reliable.pdf</Key><LastModified>2020-04-22T18:33:17.000Z</LastModified><ETag>&quot;9e1f69379da5fa2c7d6d756c7f23e5c4-2&quot;</ETag><Size>24975901</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Dynamic Connectivity FULL Slides17.pdf</Key><LastModified>2019-07-02T21:23:36.000Z</LastModified><ETag>&quot;3e0f8809fae4c07d4038775526151f57&quot;</ETag><Size>716448</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Dynamic Connectivity Small17.pdf</Key><LastModified>2019-07-02T21:23:36.000Z</LastModified><ETag>&quot;b33b3cda4c7147d1a0b52f995d0c6f1d&quot;</ETag><Size>316492</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Effects Without Monads.pdf</Key><LastModified>2020-11-04T17:49:22.000Z</LastModified><ETag>&quot;08ebc72ea39c4a2a55a0b0862ee39b10&quot;</ETag><Size>316232</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Effects of FPGA Architecture on FPGA Routing.PDF</Key><LastModified>2020-04-17T20:00:19.000Z</LastModified><ETag>&quot;ed5675599c908262b608f92b2d4d8375&quot;</ETag><Size>35770</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>FingerTree.pdf</Key><LastModified>2019-07-02T21:23:41.000Z</LastModified><ETag>&quot;d41d13c83844a0137cd0e2b4a6a3afa0&quot;</ETag><Size>172801</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Foundations of Data Science.pdf</Key><LastModified>2019-07-02T21:23:38.000Z</LastModified><ETag>&quot;3395ee0200031e7928845cf3f48d16a4&quot;</ETag><Size>2493724</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Graph Algorithms Used in Optimizing Compilers.pdf</Key><LastModified>2019-07-02T21:23:38.000Z</LastModified><ETag>&quot;84c06e3a0b0fac156d014016f151da89&quot;</ETag><Size>729606</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Graph Oracle Models.pdf</Key><LastModified>2019-07-02T21:23:29.000Z</LastModified><ETag>&quot;d620f5380355d09b8c3df8183d9ae710&quot;</ETag><Size>505575</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Haskell music.pdf</Key><LastModified>2019-07-02T21:23:38.000Z</LastModified><ETag>&quot;c0df269e93978e951e4c535c0bc8604e&quot;</ETag><Size>4071807</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Hierarchical Scheduling of DAG Structured Computations.pdf</Key><LastModified>2019-07-02T21:23:39.000Z</LastModified><ETag>&quot;92fc89cb8499ac6645c9be101b88b551&quot;</ETag><Size>870291</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Incremental Parallel and Distributed Systems.pdf</Key><LastModified>2019-07-02T21:23:29.000Z</LastModified><ETag>&quot;cc4f96667d78a945dfde6eda953b7169&quot;</ETag><Size>1119166</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Inductive Graphs and Functional Graph Algorithms.pdf</Key><LastModified>2019-07-02T21:23:36.000Z</LastModified><ETag>&quot;84989d7d8160f193159c61c46be16ad1&quot;</ETag><Size>378883</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Integrating Dataflow Evaluation into a Practical Higher-Order Call-by-Value Language.pdf</Key><LastModified>2020-04-17T20:00:34.000Z</LastModified><ETag>&quot;2db3c2350e726ceca9760d3e3ace7f1f&quot;</ETag><Size>1252889</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Lazy Depth-First Search and Linear Graph.pdf</Key><LastModified>2019-07-02T21:23:40.000Z</LastModified><ETag>&quot;75964181f74fc88ce3b25b4568e6a5a4&quot;</ETag><Size>226462</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Log(Graph)- A Near-Optimal High-Performance Graph Representation.pdf</Key><LastModified>2019-07-02T21:23:29.000Z</LastModified><ETag>&quot;c55a744e548dec229decca4993066d4f&quot;</ETag><Size>809021</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Mathematics for Computer Science.pdf</Key><LastModified>2019-07-02T21:23:34.000Z</LastModified><ETag>&quot;9464f28d632d82136f1c812581b4d678&quot;</ETag><Size>1671045</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Microsoft_WindowsGuidelines.pdf</Key><LastModified>2020-04-17T20:00:35.000Z</LastModified><ETag>&quot;bc1b7a8327a00f000caa5a3abc541b64&quot;</ETag><Size>2223306</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Monad Transformers and Modular Algebraic Effects.pdf</Key><LastModified>2020-11-04T17:49:22.000Z</LastModified><ETag>&quot;fa0d2a808db15dd17ea3b1044a54badb&quot;</ETag><Size>350819</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Notes on Graph Algorithms Used in Optimizing Compilers.pdf</Key><LastModified>2019-07-02T21:23:33.000Z</LastModified><ETag>&quot;84c06e3a0b0fac156d014016f151da89&quot;</ETag><Size>729606</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Object Spreadsheets. A New Computational Model for End-User Development of Data-Centric Web Applications.pdf</Key><LastModified>2020-04-17T20:00:26.000Z</LastModified><ETag>&quot;d094f63944cb49c93ba869e3859ecca2&quot;</ETag><Size>282888</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Overlap-free Drawing of Generalized Pythagoras Trees for Hierarchy Visualization.pdf</Key><LastModified>2020-04-17T20:00:51.000Z</LastModified><ETag>&quot;74a7a83c7635e310f070ca42111d527a&quot;</ETag><Size>2168826</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Parallel Incremental Computation.pdf</Key><LastModified>2019-07-02T21:23:35.000Z</LastModified><ETag>&quot;8336fecca51b08a91f59752b028aea8b&quot;</ETag><Size>1011585</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Patterns of Enterprise Application Architecture - Martin Fowler.pdf</Key><LastModified>2019-07-02T21:26:20.000Z</LastModified><ETag>&quot;be3592c400996cd8dd57564e32024e80&quot;</ETag><Size>4865691</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Pure Reference Counting Garbage Collector.pdf</Key><LastModified>2019-07-02T21:23:42.000Z</LastModified><ETag>&quot;e3c7e8e32064087508461d0315a689a2&quot;</ETag><Size>418938</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Reactive Lenses.pdf</Key><LastModified>2019-07-02T21:23:32.000Z</LastModified><ETag>&quot;abfa04e12031ff826734120b22b6cbbe&quot;</ETag><Size>229679</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>SELF-ADJUSTING MACHINES.pdf</Key><LastModified>2019-07-02T21:23:34.000Z</LastModified><ETag>&quot;43cf89285d15eeee7e117912834f3a67&quot;</ETag><Size>1122562</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>SQLGraph- An Efficient Relational-Based Property Graph Store.pdf</Key><LastModified>2019-07-02T21:23:45.000Z</LastModified><ETag>&quot;5db9943e6c79d8e68e3bf368672bf392&quot;</ETag><Size>881137</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>State of Art in Multilayer Network Visualization.pdf</Key><LastModified>2020-06-26T19:16:07.000Z</LastModified><ETag>&quot;97c8503e2bc674a8fededd0707a2054f&quot;</ETag><Size>3804238</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Technique for Drawing Directed Graphs.pdf</Key><LastModified>2020-06-26T19:16:07.000Z</LastModified><ETag>&quot;9c04b6880cf19bfaca02b918d90197d7&quot;</ETag><Size>3113782</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>The Combining DAG- A Technique for Parallel Data Flow Analysis .pdf</Key><LastModified>2019-07-02T21:23:46.000Z</LastModified><ETag>&quot;300b30f88e9cc63fb70b755a9d1fea5a&quot;</ETag><Size>1090619</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Tom Stuart - Understanding Computation -2013.pdf</Key><LastModified>2019-07-02T21:23:46.000Z</LastModified><ETag>&quot;d3699c9f726e74ec26d7759c2c351705&quot;</ETag><Size>10976206</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Traceable Data Types for Self-Adjusting Computation.pdf</Key><LastModified>2019-07-02T21:23:33.000Z</LastModified><ETag>&quot;7e3ab374d03a25cd4ce64bd085c0aa04&quot;</ETag><Size>423290</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Typed Tagless Final Interpreters.pdf</Key><LastModified>2019-07-02T21:23:35.000Z</LastModified><ETag>&quot;12b110712e327ed41f0ddcb149dc8385&quot;</ETag><Size>281067</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>VPR New packing placement and routing tool.pdf</Key><LastModified>2020-04-17T20:00:16.000Z</LastModified><ETag>&quot;2e3495488faf7b8f59d09973c2dc3098&quot;</ETag><Size>39539</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Vector Models for Data-Parallel Computing.pdf</Key><LastModified>2019-07-02T21:23:49.000Z</LastModified><ETag>&quot;6a0a828ee2179f48e17e923d2a66166e&quot;</ETag><Size>1349154</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Why Philosophers Should Care About Computational Complexity.pdf</Key><LastModified>2019-07-02T21:23:50.000Z</LastModified><ETag>&quot;77266db785c98b24c70426b4d22878f0&quot;</ETag><Size>608991</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>dynamic overlay graph.pdf</Key><LastModified>2019-07-02T21:23:37.000Z</LastModified><ETag>&quot;041aac6dc2e944ed20cfd60c27500dd0&quot;</ETag><Size>368686</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>elm-concurrent-frp.pdf</Key><LastModified>2020-01-16T14:17:54.000Z</LastModified><ETag>&quot;7c394988bf3e8838002e856810a5ab1f&quot;</ETag><Size>926140</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>interlisp-vm.pdf</Key><LastModified>2019-07-02T21:23:40.000Z</LastModified><ETag>&quot;81c6f601975f55b37282d59aec116478&quot;</ETag><Size>7720017</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>interval graphs.pdf</Key><LastModified>2019-07-02T21:23:40.000Z</LastModified><ETag>&quot;211c8db1fffec71a88a666c67367dfd0&quot;</ETag><Size>1302566</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>latest-r1991.pdf</Key><LastModified>2019-07-02T21:23:29.000Z</LastModified><ETag>&quot;977a7e00f9ec5f457de8de34d9442f04&quot;</ETag><Size>4950761</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>leftist trees.pdf</Key><LastModified>2019-08-29T07:54:41.000Z</LastModified><ETag>&quot;0bc97e1ece518d0e6be035253c521aa7&quot;</ETag><Size>230448</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>network-spanning-tree.pdf</Key><LastModified>2019-07-02T21:23:29.000Z</LastModified><ETag>&quot;e36649cb7500e9078a63eb4108a5d58c&quot;</ETag><Size>916737</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>practical foundations for programming languages.pdf</Key><LastModified>2019-07-02T21:23:41.000Z</LastModified><ETag>&quot;6e242f96f5ee14766034054a7a31148d&quot;</ETag><Size>1156805</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>procPaper4.pdf</Key><LastModified>2019-07-02T21:23:31.000Z</LastModified><ETag>&quot;461dc41257d71b3249817b45a3c8a9c4&quot;</ETag><Size>172116</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>profiling-node.pdf</Key><LastModified>2019-07-02T21:23:42.000Z</LastModified><ETag>&quot;4b9e42f4c905449e6b21bb5df74da930&quot;</ETag><Size>8129775</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>sagas.pdf</Key><LastModified>2019-07-02T21:23:43.000Z</LastModified><ETag>&quot;1303b76900107f37a643db65553fc9ee&quot;</ETag><Size>1235147</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>spineless-tagless-gmachine.pdf</Key><LastModified>2019-07-02T21:23:45.000Z</LastModified><ETag>&quot;1cd524ba596699b9d436ca4b069c6ed2&quot;</ETag><Size>535215</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>transfinite arrays.pdf</Key><LastModified>2019-07-02T21:23:48.000Z</LastModified><ETag>&quot;0c4a72a90c3e7970393767ffc5bc9984&quot;</ETag><Size>403746</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>weaver zipper.pdf</Key><LastModified>2019-07-02T21:23:29.000Z</LastModified><ETag>&quot;c94a02cb8136c8ec729732a29522ec2d&quot;</ETag><Size>391010</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>zip trees.pdf</Key><LastModified>2019-07-02T21:23:50.000Z</LastModified><ETag>&quot;bfe6afb8ec7c154ceeb33c34a03bf46b&quot;</ETag><Size>374622</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>zipcfg.pdf</Key><LastModified>2019-07-02T21:23:29.000Z</LastModified><ETag>&quot;cb233977a400ded71719abef84bc60a5&quot;</ETag><Size>224755</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Ахо, Хопркрофт, Уллман - Структуры.данных.и.алгоритмы - 2003.pdf</Key><LastModified>2019-07-02T21:23:52.000Z</LastModified><ETag>&quot;1472e9850804b33e9f87bf0d22e75c9f&quot;</ETag><Size>47635442</Size><StorageClass>STANDARD</StorageClass></Contents><Contents><Key>Диплом.pdf</Key><LastModified>2019-07-02T21:23:29.000Z</LastModified><ETag>&quot;3df4cf70c977e9230e8567b9b7470af3&quot;</ETag><Size>1756235</Size><StorageClass>STANDARD</StorageClass></Contents></ListBucketResult>