yusuke1997/dblp-id-title huggingface dataset:
Application of "DOVETAILING" to program testing
Topology control and routing in ad hoc networks: a survey
SIGACT News Online Algorithms Column 40: 2022 in review
Computational geometry column 33
The reordering buffer problem on the line revisited
Review of Introduction to Distributed Algorithms
Review of "Theoretical and Experimental DNA Computation by M. Amos, " Springer-Verlag Berlin Heidelberg, 2005
Review of bioinformatics for biologists edited by Pavel Pevzner and Ron Shamir
Distributed Symmetry: Breaking from a Local Point of View
The reentry Computer Science Program at U.C. Berkeley
Review of the traveling salesman problem: a computational study by Applegate, Bixby, Chvátal, and Cook (Princeton University Press)
SIGACT News Complexity Theory Column 106: Teaching Models, Computability, and Complexity in Time of COVID-19
Review of: Polyhedral and Algebraic Methods in Computational Geometry by Michael Joswig and Thorsten Theobald
Propositions with multiple dispositions and multiple truth values
Review of "Mariages stables et leur relations avec d'autre problèmes combinatoires: introduction à l'analyze mathématique des algorithmes" by Donald E. Knuth. Les Presses de l'Université de Montréal
Review of Art in the Life of Mathematicians by Anna Kepes Szemerédi
Review of proof, language, and interaction: essays in honour of Robin Milner edited by Plotkin, Stirling and Tofte
WTTM 2013, the fifth workshop on the theory of transactional memory
Review of Pólya Urn models by Hosam Mahmoud
Computing variance for interval data is NP-hard
A brief response to J. A. Cohen's joint review
Classical versus quantum communication complexity
Graduate degrees on the Web
SIGACT news logic column 21
Review of Surveillance or Security? by Susan Landau
Report on the 6th international meeting on DNA-based computers
Algorithms, Problem Solving, and Data Structures with C++
Quantum cryptanalysis of hash and claw-free functions
Database Theory Column: Report on PODS 2016
Space wars and other things
A polynomial-time algorithm for solving NP-hard problems in practice
A note on complete sets for the polynomial-time hierarchy
Review of visibility algorithms in the plane by Subir Kumar Ghosh (Cambridge University Press, 2007)
Data structures and problem solving using Java
Paul Erdos (1913-1996)
Review of who's #1?: the science of ranking and rating by Amy N. Langville and Carl D. Meyer
Transactions are back---but are they the same?: "Le Retour de Martin Guerre" (Sommersby)
From the recursive function theory newsletter
Complexity Theory Newsflash
The representation of a program in the Blum-Shub-Smale theory of computation over an arbitrary ring
Review of "Algebraic and automata-theoretic properties of formal languages" by Seymour Ginsburg. North Holland, 1975
SIGACT News Complexity Theory Column 116
Uniform characterizations of complexity classes
Review of "Proofs and refutations: the logic of mathematical discovery" by Imre Lakatos. Cambridge University Press 1976
Review of Comprehensive mathematics for computer scientists 1 by authors: Guerino B. Mazzola, Gerard Milmeister, Jody Weissmann
The future of computational complexity theory: part II
Behind the Scenes of K&CK: the undelivered speech for the 2009 Dijkstra prize
SIGACT News Complexity Theory Column 123
Distributed Computing Column 60: Annual Review 2015
The Book Review Column1
Random curves: journeys of a mathematician by Neal Koblitz published by springer 2008 390 pages
Review of grammatical inference: learning automata and grammars by Colin de la Higuera
SIGACT News Complexity Theory Column 87: Introduction to Complexity Theory Column 87
On distributed computing principles in systems research: introduction
Review of "Algorithms: Sequential, Parallel, and Distributed by Kenneth A. Berman and Jerome L. Paul", Thomson Course Technology, 2005
Survey on classes of interpretations and some of their applications
An interview with Vladimir Trifonov 2005 Danny Lewin best student paper award winner
SIGACT news online algorithms column 8
Distributed computing column 42: game theory and fault tolerance in distributed computing
Review of vehicular networks, from theory to practice, edited by Stephan Olariu and Michele C. Weigle
Self-stabilization at WSS'01 and DISC'01
Routing and network design with robustness to changing or uncertain traffic demands
Distributed Computing Column 39: Byzantine Generals: The Next Generation
SIGACT News Complexity Theory Column
Review of mathematics for the analysis of algorithms by Daniel H. Greene and Donald E. Knuth
Review of Quantum Walks and Search Algorithms by Renato Portugal
A note on "Some simplified NP-complete graph problems"
Review of SIROCCO 2009
Computational geometry column 50
A note on disjunctive form tautologies
The sets of real and complex numbers are denumerable
SIGACT News Online Algorithms Column 25: Online Primal Dual: Beyond Linear Programs
Modification of Aho and Ullman's correctness proof of Warshall's algorithm
Review of Market Design: A Linear Programming Approach to Auctions and Matching
Review of: The Mathematics of Encryption An Elementary Introduction by Margaret Cozzens and Steven J. Miller
Distributed approximation: a survey
Review of Applied Information Security by David Basin, Patrick Schaller, and Michael Schläpfer
BOOK REVIEW: The Temporal Logic of Reactive and Concurrent Systems - Specification. By Zohar Manna and Amir Pnueli. (Springer-Verlag, 1991. xiv+427pp. ISBN 0-387-97664-7 . $49.95)
In-place algorithms for sorting problems
On uninteresting theorems
Dynamic networks: models and algorithms
Edsger W. Dijkstra: The Man Behind the Prize
On the NP-completeness of cryptarithms
Correcting an Error in a 'Cheat Sheet'
Hardware Trends: Challenges and Opportunities in Distributed Computing
Review of "Semantic Integration of Heterogeneous Software Specifications by Martin Grobe-Rhode", Springer-Verlag, 2004
The Complexity of the Shortest Vector Problem
Review of "Immunocomputing: Principles and Applications by Alexander O. Tarakanov, Victor A. Skormin, Svetlana P. Sokolova", Springer-Verlag New York, Inc. 2003
Computational Geometry Column 61
Report on PODS 2013
Some abstracts from The Computer Science Conference
An introduction to data structures and algorithms by James A. Storer Birhauser
Review of handbook of weighted automata, edited by Manfred Droste, Werner Kuich and Heiko Vogler
Review of Blown to Bits: Your Life, Liberty, and Happiness after the Digital Explosion by Hal Abelson, Ken Ledeen, Harry Lewis, and Wendy Seltzer
SIGACT news complexity theory column 31
ACM SIGACT news distributed computing column 16
Review of matching theory, by László Lovász and Michael D. Plummer
SIROCCO 2019 Review
A pumping theorem for regular languages
PODC 2016 Review
Review of "Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenge by Michael H. Goldwasser, David S. Johnson, Catherine C. McGeoch", American Mathematical Society 2002
The complexity of songs
Review of the Third Summer School on the Practice and Theory of Distributed Computing SPTDC 2020
SIGACT News Complexity Theory Column 113
Review of permutation patterns, edited by Steve Linton, Nik Ruškuc, Vincent Vatter
Angular resolution of straight-line drawings (abstract)
A potential-based amortized analysis of the union-find data structure
Review of the universal computer: the road from Leibniz to Turing by Martin Davis
Computational Geometry Column 64
Probability and Computing
Computational geometry column 8
Figures of merit: the sequel
A survey of buffer management policies for packet switches
Review of Trends in Computational Social Choice Edited by Ulle Endriss
Database Theory Column: Query Languages for Complex Object Databases
SIGACT News Complexity Theory Column 112
Report on The First International Workshop on Implementing Automata 1996
Review of introduction to computational proteomics by Golan Yona
Review of "Algebraic Complexity Theory by Peter Bürgisser, Michael Clausen and Amin Shokrollahi", Springer 1997
Proving expansion in three steps
Journal backlog report
Review of higher arithmetic: an algorithmic introduction to number theory by H. M. Edwards (American Mathematical Society Student Mathematical Library Vol. 45 (2008)
What should computer science students learn from mathematics?
Online and incremental algorithms for facility location
Review of Algorithmic Aspects of Machine Learning By Ankur Moitra
SIGACT news online algorithms column 1
Review of P, NP, and NP-Completeness by Oded Goldreich
Review of Combinatorics and graph theory: (second edition) by John M. Harris, Jeffry L. Hirst and Michael J. Mossinghoff
International efforts in computer science education
Computational geometry column 38
Review of "Learning Kernel Classifiers: Theory and Algorithms by Ralf Herbrich." MIT Press, Cambridge, Mass., 2002. ISBN 026208306X, 384 pages; and Review of "Learning with Kernels: Support Vector Machines, Regularization Optimization and Beyond by Bernhard Scholkopf and Alexander J. Smola." IT Press, Cambridge, Mass., 2002, ISBN 0262194759, 644 pages
Cloud computing architecture and application programming: DISC'09 tutorial, half day, Sept. 22nd 2009
How to design dynamic programming algorithms sans recursion
Logic and databases: a critique
2013 Dijkstra Prize in distributed computing to Nati Linial: 2013 Principles of Distributed Computing Doctoral Dissertation Award to Shiri Chechik and Danupon Nanongkai
Book review: Microsurveys in Discrete Probability edited by David Aldous and James Propp. (AMS 1998)
Joint review of the mathemagician and pied piper: a collection in tribute to Martin Gardner
SIGACT News Online Algorithms Column 32: 2017 in review
Review of universal semantic communication by B. Juba
Book review: Logic For Applications, Second Edition by Anil Nerode and Richard A. Shore (Springer Verlag 1997)
Review of "Symbolic Asymptotics by John R. Shackell", Springer Verlag, 243 pages, $79.95
Guest Column: One-Tape Turing Machine Variants and Language Recognition
Review of Communication Networks: An Optimization, Control, and Stochastic Networks Perspective R. Srikant and L. Ying
Lowness: a yardstick for NP-P
Bremen workshop review
Joint review of algorithms by Richard Johnsonbaugh and Marcus Schaefer (Pearson/Prentice-Hall, 004) and algorithms by Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani (McGraw-Hill, 008)
Research advance abstracts
Review of: A Guide to Experimental Algorithmics by Catherine C. McGeoch
Distributed computing column 44 2011 in review
Two exercises
A pleasant stroll through the land of infinitely many creatures
Review of Power Up: : Unlocking the hidden mathematics in video games
Education and the World Wide Web
Distributed Algorithms as Combinatorial Structures
Suitening our nomenclature
SIGACT news complexity theory column 38
Distributed computing column 53: Dagstuhl seminar review: consistency in distributed systems
Quantum computing: the end of classical cryptography?
Complexity Theory Column 88: Challenges in Polynomial Factorization1
The joys of being an NSF program director
A Joint Review of "A History of Pi, by Petr Beckmann", St. Martins's Press, 1976, Barnes and Noble Books, 1989; "The Joy of Pi, by David Blatner", Walker & Co., 1997; "The Nothing That Is, by Robert Kaplan", Oxford University Press, 1999; "e: The Story of a Number, by Eli Maor", Princeton University Press, 1998; "An Imaginary Tale, by Paul Nahin", Princeton University Press, 1998; "Zero: The Biography of a Dangerous Idea, by Charles Seife", Viking Press, 2000
Some applications of a technique of Sakoda and Sipser
Distributed Computing Column 84: Perspectives on the Paper "CCS Expressions, Finite State Processes, and Three Problems of Equivalence"
Parallel processing and parallel algorithms: theory and computation
Review of "Complexity Theory and Cryptology: An Introduction to Cryptocomplexity by Jörg Rothe", Springer, 2005, 484 pages
Fundamentals of computing (a cheatlist)
Distributed computing column 54 transactional memory: models and algorithms
Review computation engineering: applied automata theory and logic
Review of "Secure Communicating Systems: Design, analysis, and implementation by Michael R A Huth", Cambridge University Press, 2001
The tower of Hanoi problem with arbitrary start and end positions
Distributed Computing Column 64: Annual Review 2016
Review of algorithmic bioprocesses, edited by Condon, Harel, Kok, Salomaa, Winfree
Review of Real-World Algorithms: A Beginner's Guide by Panos Louridas
Open-source grid technologies for web-scale computing
Review of a concise introduction to data compression by David Salomon
Pessimization is unsolvable
2018 Knuth Prize is Awarded to Johan Håstad
Distributed Computing Column 73 SPAA 2018 Review
Fixed-Parameter Extrapolation and Aperiodic Order: Open Problems
Review of Parameterized Complexity by R. Downey and M. Fellows
The Burrows-Wheeler transform: data compression, suffix arrays, and pattern matching by Donald Adjeroh, Timothy Bell and Amar Mukherjee Springer, 2008
Conjugate coding
Review of Burdens of Proof By Jean-François Blanchette
Algorithms for drawing trees (abstract)
Wide area technical report service - technical reports online
Computational geometry column 9
Kanellakis-Smolka 1983: A Convolution of Circumstances
Communication complexity for file synchronization is undecidable
SIGACT news online algorithms column 4
Modularity: a first class concept to address distributed systems
Education Forum: Animated Textbooks: A Current Example
Decidability of bisimulation equivalence for normed pushdown processes
Elastic Consistency: A Consistency Criterion for Distributed Optimization
Computability and complexity theory and the complexity theory companion
Review of "Essentials of Constraint Programming by T. Fruhwirth and S. Abdennadher." Springer-Verlag
Applying practice to theory
An alternate proof of Aho & Ullman's LR(k) viable prefix theorem
Review of codes: an introduction to information communication and cryptography by Norman L Biggs
Review of: Quantum Information Theory by Mark M. Wilde
The satanic notations: counting classes beyond #P and other definitional adventures
Guest Column: A Primer on the Statistics of Longest Increasing Subsequences and Quantum States (Shortened Version)
Open questions in the theory of semifeasible computation
Want scalable computing?: speculate!
Database Theory Column: Deciding Bounded Recursion in Database Logic Programs
Review of What Can Be Computed: A Practical Guide to the Theory of Computation by John MacCormick
The theoretic center of computer science
On the integer complexity of Boolean matrix multiplication
SIGACT news online algorithms column 2
Some simple but interesting results concerning the P ?= NP Problem
Scalable byzantine computation
Distributed Computing Column 79: Using Round Elimination to Understand Locality
Distributed Computing Column 77 Consensus Dynamics: An Overview
Programming challenges: the programming contest training manual
A course in enumeration by Martin Aigner, Springer, 2007 555 pages, hardcover
SIGACT News Online Algorithms Column 36: 2020 in review
Report on PODS '96
Review of number theory for computing
One-sided height-balanced search trees
Distributed Computing Column 70: Formalizing and Implementing Distributed Ledger Objects
Cryptographic technology: fifteen year forecast
The annotated turing by Charles Petzoid, Publisher Wiley, 2008
Joint review of general lattice theory (second edition) and the congruences of a finite lattice: a proof-by picture approach
A princess swimming in the fog looking for a monster cow
Review of networked life: 20 questions and answers by Mung Chiang
Review of: Algorithmic Barriers Falling: P=NP? by Donald E. Knuth and Edgar G. Daylight and The Essential Knuth by Donald E. Knuth and Edgar G. Daylight
Review of Geometric algebra for computer science by Leo Dorst, Daniel Fontijne, and Stephen Mann(Morgan Kaufmann Publishers, 2007)
Review of combinatorial pattern matching algorithms in computational biology using Perl and R, by Gabriel Valiente
Review of the life and times of the central limit theorem by William J. Adams
Guest Column: Structure in Communication Complexity and Constant-Cost Complexity Classes
Review of: A Wealth of Numbers: An Anthology of 500 Years of Popular Mathematics Writing by Benjamin Wardhaugh
The future of computational complexity theory: part I
Review of Distributed Computing by Attiya and Welch
A note on the multiplication of 4x4 matrices
SIGACT news logic column 15
Can a computer proof be elegant?
SIGACT News Complexity Theory Column 115: Juris Hartmanis and Two Golden Rules
Review of "Linguistic Structures Processing" by A. Zampolli. North Holland Publishing Company 1977
Information Complexity and the Quest for Interactive Compression
Review of "The Art of Computer Programming, Volume 4, Fascicles 2, 3, and 4 by Donald E. Knuth, " Pearson Education (Addison-Wesley), 2005
Query languages for bags: expressive power and complexity
Automata theory with modern applications by James A. Anderson, Cambridge University Press, 2006, viii+256 pages
Review of "DNA based computers V" by Eric Winfree and David K. Gifford. American Mathematics Society
Review of: Digital Signatures by Jonathan Katz
Computational Geometry Column 60
What does O(n) mean
SIGACT News Complexity Theory Column 85
Guest column: the elusive inapproximability of the TSP
Review of origins and foundations of computing, by Friedrich L. Bauer
A moment of perfect clarity II: consequences of sparse sets hard for NP with respect to weak reductions
Review of "A Beginner's Guide to Discrete Mathematics by W. D. Wallis", Birkhuser, 2003
Hilbert's Tenth Problem: Refinements and Variants
Book Review: Discrete Mathematics in the Schools. Ed. by Joseph G. Rosenstein, Deborah S. Franzblau, and Fred S. Roberts (American Mathematical Society)
Review of Complex social networks by Fernando Vega-Redondo
The glass ceiling: in theory women swell ranks of science, but remain invisible at the top
Review of models of computation: an introduction to computability theory, by Maribel Fernández
Review of graph algorithms (2nd edition) by Shimon Even, edited by Guy Even
Review of "The Political Mapping of Cyberspace by Jeremy W. Crampton", The University of Chicago Press, 2003
A theory repository on the Web: a proposal
Review of Coding theory and cryptography: the essentials, second edition, revised and expanded by D.R. Hankerson, et al. Marcel Dekker, 2000
Review of Kolmogorov Complexity and Algorithmic Randomness by A. Shen, V. A. Uspensky, and N. Vereshchagin
The game of academe
Book Review: The Deductive Foundations of Computer Programming. By Zohar Manna and Richard Waldinger. (Addison-Wesley, 1993. xiv+717pp. ISBN 0-201-54886-0. $46.25)
On folk theorems
SIGACT news logic column 13
Report on COLT 1994
Review of Q is for Quantum by Terry Rudolph
Recent Algorithmic Advances in Population Protocols
Two recent algorithms for the global minimum cut problem
Guest Column: Analytic Combinatorics and Descriptional Complexity of Regular Languages on Average
Review of "Foundations of Computer Security by David Salomon, " Springer-Verlag, 2006
ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting
Privacy on the line: the politics of wiretapping and encryption
Report on graph drawing '94
SIGACT news complexity theory column 71
On teaching theoretical foundations of Computer Science
A review of the DISC 2006 conference
Review of applied combinatorics on words
Dynamic graph drawing (abstract)
Specifying confidentiality
SICACT Treasurer's Report
Improved string matching with k mismatches
Guest Column: A Survey of Quantum Learning Theory
LITP: Laboratoire D'Informatique theorique et programmation Paris Presentation of scientific activity
Planar 3-colorability is polynomial complete
Distributed Computing Column 38: Models for algorithm design in wireless networks
Database Theory Column
Aggregability is NP-hard
History and Context for Defining Liveness: Winner 2018 Edsger W. Dijkstra Prize
Theory research at Google
SIGACT News Complexity Theory Column 99
A note on prefixes of regular languages
Computational Geometry Column 30
Can quantum mechanics help distributed computing?
ACM SIGACT news distributed computing column 35: theory and practice in large distributed systems
Review of "Unsolvable classes of quantificational formulas" by Harry R. Lewis. Addison-Wesley 1979. and "The decision problem: solvable classes of quantificational formulas" by Burton Dreben and Warren D. Goldfarb. Addison-Wesley 1979
Review of computability and complexity theory by Steven Homer and Alan L. Selman
Teaching about threading: where and what?
Computational geometry column 44
Reliability and security in wireless networks
Guest Column: PAC Learning is just Bipartite Matching (Sort of)
Review of cryptanalytic attacks on RSA by Song Y. Yan
Book Review: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, Volume One . By Kurt Jensen. (Springer-Verlag, 1992. vii+234 pages. ISBN 0-387-55597-8. $69 .00)
Review of "Checking Landau's "Grundlagen" in the Automath system" by L. S. Van Benthem Jutting. Mathematical Centre 1979.: "First order dynamic logic" by David Harel. Springer-Verlag 1979. And "A programming logic" by Robert L. Constable and Michael J. O'Donnell. Winthrop Publishers 1978
Guest Column: A Recipe for Constructing Two-Source Extractors
On Superpolylogarithmic Subexponential Functions (Part II)
Distributed Computing Column 86 The Environmental Cost of Our Conferences
Computational geometry column 31
ACM SIGACT News distributed computing column 12
An experimental assignment on random processes
Will I be pretty, will I be rich?: some thoughts on theory vs. practice in systems engineering
Coalgebras and their logics
Essays in constructive mathematics by Harold M. Edwards, published by Springer, 2005 211 pages, hardcover
Review of bayesian reasoning and machine learning by David Barber
Review of the pea and the sun: a mathematical paradox by Leonard Wapner Published by A.K. Peters, 2005
Review of "Research Problems in Discrete Geometry by Brass, Moser, Pach, " Springer-Verlag
Distributed computing column 48: annual review 2012
Postscript about NP-hard problems
On Superpolylogarithlnic Subexponential Functions (Part I)
The Turing machine of Ackermann's function
On the Aanderaa-Rosenberg Conjecture
Review of The Satisfiability Problem: Algorithms and Analyses by Uwe Schöning and Jacobo Torán
Review of "The code book: the evolution of secrecy from Mary Queen of Scots to quantum cryptography" by Simon Singh. Anchor Books
Etude on theme of Dijkstra
SIGACT news complexity theory column 59: introduction
Review of the mathematical coloring book: mathematics of coloring and the colorful life of its creators by Alexander Soifer
Review of a course on the web graph by Anthony Bonato (American Mathematical Society, Providence, Rhode Island, USA)
Review of rippling: meta-level guidance for mathematical reasoning cambridge tracks in theoretical computer science 56 by Alan Bundy, David Basin, Dieter Hutter, and Andrew Ireland
SIGACT News Complexity Theory Column 91
SIGACT news complexity theory column 35
Review of Mathematics Galore: The First Five Years of the St. Marks' Institute of Mathematics by James Tanton
Book review: Privacy on the Line by Whitfield Diffie and Susan Landau (MIT Press 1998)
Review of combinatorics: a guided tour by David R. Mazur
Computational geometry column 55: new developments in nonnegative matrix factorization
Language, mathematics and other dangerous things
Correction to "Regularity preserving functions"
A sequence of uncomputable functions
Elements of the Theory of Computation
Thoughts of a former Program Director
A restated pumping lemma for context-free languages
SIGACT News complexity theory column 32
Review of ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks by Dan Gusfield
Review of Computational Geometry: Algorithms and Applications (2nd ed.) by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf
SIGACT News Online Algorithms Column 30: 2016 in review
A lower bound on the path length of binary trees
Review of: A Walk Through Combinatorics by Miklós Bóna
A Survey of Performance Measures for On-line Algorithms
Review of Practical Data Science with R by Nina Zumel and John Mount