yusuke1997/dblp-id-title huggingface dataset:
Review of 5 of biologically inspired algorithms for financial modelling by Anthony Brabazon, Michael O'Neill Springer-Verlag Berlin Heidelberg, 2006
Review of selected papers on fun & games by Donald E. Knuth
On teaching theoretical foundations of computer science
Verifying Temporal Properties of Systems . By Julian Charles Bradfield. (Birkhauser, 1992 viii+113pp . ISBN 0-8176-3625-0 . $49.50)
Maps of the interval, polynomial time, and polynomial space
Review of Mathematical Support for Molecular Biology edited by Martin Farach-Colton , Fred S. Roberts, Martin Vingron, and Michael Waterman
Review of PODC 2014
Review of finite fields and applications by Gary L. Mullen and Carl Mummert
Complexity theory column 5: the not-ready-for-prime-time conjectures
Periodic properties of strings
BOOK REVIEW: Action Semantics. By Peter D. Mosses. (Cambridge University Press, 1992. xx+372pp. ISBN 0-521-40347-2. $49.95)
Review of Information Retrieval By Buettcher, Clarke, Cormack
An expression model for graphical command languages
Review of "Probability and Computing: Randomized Algorithms and Probabilitic Analysis by Michael Mitzenmacher and Eli Upfal", Cambridge University Press, 2005
Guest Column: Algebraic Natural Proofs Ben Lee Volk
WTTM 2011: the third workshop on the theory of transactional memory
Review of "Term Rewriting Systems by Terese", Cambridge University Press 2003, 0-521-39115-6
Review of Forbidden Configurations in Discrete Geometry by David Eppstein
SIGACT News Complexity Theory Column 84
Education Forum: The Dynalab Animation System
Review of introduction to modern cryptography by Jonathan Katz and Yehuda Lindell Publisher: Chapman & Hall-CRC 2008 1-58488-551-3
Computational geometry column 23
A short introduction to failure detectors for asynchronous distributed systems
Deadlock detection in communicating finite state machines
Decisions and elections: explaining the unexpected author: Donald G. Saari publisher: cambridge university press, 2001 isbn 0-521-80816-2
Review of an introduction to the history of algebra solving equations from Mesopotamian Times to the Renaissance by Jacques Sesiano
Combinatorics the rota way by Joesph P.S. Kung, Gian-Carlo Rota and Catherine H. Yan, published by Cambridge Press, 2009 396 pages, softcover
Review of Geometric algebra: an algebraic system for computer games and animation by J. Vince
Using Go in teaching the theory of computation
Review of a new kind of science
Open Problems About Grid Coloring and The Complexity of Grid Colorings
Database Theory Column Report on PODS 2014
A time-space tradeoff for sorting and related non-oblivious computations
27 Open Problems in Kolmogorov Complexity
Book Review: Nets, Terms and Formulas . By E.-R. Olderog. (Cambridge University Press, 1991 . x+267pp. ISBN 0-521-40044-9 . $49.95)
Algorithmic elimination of spurious nondeterminism from Mealy machines
Distributed Computing Column 72: Annual Review 2018
SIGACT News Online Algorithms Column 37
A regularity condition for parallel rewriting systems
Review of Nonlinear Integer programming by Duan Li and Xiaoling Sun
Review of triangulations: structure for algorithms and applications by Jesús A. De Lorea, Jörg Rambau, and Francisco Santos
Accountability and the public trust
ACM SIGACT news distributed computing column 9
Review of Network Flow Algorithms David P. Williamson
Applications of graph drawing to software engineering (abstract)
A note on the transitive closure of a boolean matrix
Advanced data structures by Peter Brass Cambridge University Press 2008
Review of "Integer Programming, by Laurence A. Wolsey", Wiley and Sons 1998
Generating a set of fundamental cycles in a graph
Review of "Proofs that Really Count: The Art of Combinatorial Proof by Arthur T. Benjamin and Jennifer J. Quinn"; MAA, 2003
Guest Column: correlation bounds for polynomials over {0 1}
Some Open Problems in Fine-Grained Complexity
An introduction to ultimately periodic sets of integers
Computational geometry column 56
Review of "Teaching Statistics Using Baseball, by Jim Albert", MAA, 2003
Computational geometry column 49
Arcs in graphs are NOT pairs of nodes
On the cost of fault-tolerant consensus when there are no faults: preliminary version
WTTM 2012, the fourth workshop on the theory of transactional memory
The tree structure of exponential calculations - Addendum
Review of Applied Number Theory
The story of set disjointness
Review of "The theory of computer science: a programming approach" by J. M. Brady. Chapman and Hall
Review of Crypto School by Joachim von zur Gathen
Review of who's bigger?: where historical figures really rank by Steven Skiena and Charles B. Ward
Education Forum: Matter of Salesmanship
Review of: Metamathematics, Machines, and Gödels Proof by N. Shankar
Brief Introduction to Quantum Computing for Undergraduate Students: Lecture Two-Review of Linear Algebra and Complex Numbers
Review of famous puzzles of great mathematicians by Miodrag S. Petkoviç
Joint Review of The Mathematics of Various Entertaining Subjects: Research in Recreational Math and The Mathematics of Various Entertaining Subjects: Vol. 2. Research in Games, Graphs, Counting, and Complexity and The Mathematics of Various Entertaining Subjects Vol. 3. The Magic of Mathematics
Report on PODS'97
The Busy Beaver Frontier
ACM SIGACT news distributed computing column 24
Report on GRA-GRA: 4th international workshop on graph grammars and their applications to computer science
SIGACT News Complexity Theory Column 93
Review of: Asymptopia by Joel Spencer and Laura Florescu
How to find the best approximation results
Review of the Erdös distance problem by Julia Garibaldi, Alex Iosevich and Steven Senger
Distributed Computing Column 61: Distributed Algorithmic Foundations of Dynamic Networks
Nine lower bound conjectures on streaming approximation algorithms for CSPs
Review of Introduction To Property Testing by Oded Goldreich
Computer viruses and malware by John Aycock
ACM SIGACT news distributed computing column 32: the year in review
Cryptology - column 4: hiding information from oracles
Review of: Jewels of Stringology by Maxime Crochemore and Wojciech Rytter
Multiple-size divide-and-conquer recurrences
Constructing a finite automaton for a given regular expression
Book review: A Unifying Framework for Structured Analysis and Design Models, By T. H. Tse, (Cambridge University Press, 1991, xi+179pp, ISBN 0-521-39196-2)
A new method for planar graph drawings on a grid (abstract)
NSF report: theory of computing program
Complexity theory
Remembering Juris
Review of clustering in bioinformatics and drug design by John D. MacCuish and Norah E. MacCuish
SIGACT News Complexity Theory Column 102
SETH vs Approximation
Distributed computing column 49: coding for distributed storage
Query languages with arithmetic and constraint databases
Book review: Computational geometry in C Second Edition by Joseph O'Rourke (Cambridge University Press 1988)
Logicomix text by Apostolos Doxiadis and Christos Papadimitriou Art by Alecos Papadatos and Annie di Donna, published by Bloomsbury, 2009 314 pages, softcover. comic book!
Review of algorithms and theory of computation handbook by Mikhail J. Atallah and Marina Blanton
Recent advances on the matroid secretary problem
On the outer: women in computer science courses
The Complexity of Chromatic Number When Restricted to graphs with Bounded Genus or Bounded Crossing Number
Cryptology - column 2
Review of "Fair Division and Collective Welfare by Hervé Moulin", MIT Press, 2003
Review of Set theory for computing: from decision procedures to declarative programming with sets by Domenico Cantone, Eugenio Omodeo and Alberto Policriti. Springer-Verlag 2001
A general method for solving divide-and-conquer recurrences
Review of graph theory: a problem oriented approach by Daniel Marcus
A protocol for signing contracts
How to present a paper in theoretical computer science: a speaker's guide for students
SIGACT News Online Algorithms Column 31
Higher-order abstract syntax: setting the record straight
A practical turing machine representation
Biomolecular computing: recent theoretical and experimental advances
Open problems: 3
Review of Number Theory: An Introduction via the Density of Primes, second edition
Typically-correct derandomization
Distributed computing meets game theory: combining insights from two fields
Review of: Martin Gardner in the Twenty-First Century: Edited by Michael Henle and Brian Hopkins
Tests for primality under the Riemann hypothesis
Three dozen papers on online algorithms
Review of Hilbert's Tenth Problem by Yttri Matiyasevich
Review of design theory by C. C. Lindner and C. A. Rodger
Review of elliptic curves by Lawrence C. Washington 2008, Chapman and Hall
Review of parallel algorithms by Henri Casanova, Arnaud Legrand, and Yves Robert
Coin flipping by telephone a protocol for solving impossible problems
Area requirements (abstract)
Duality, finite improvement and efficiently solved optimization problems
Joint review of Foundations of cryptography: basic tools by O. Goldreich. Cambridge University Press. and Modelling and analysis of security protocols by P. Ryan and S. Schneider. Addison Wesley
Review of The Geometry of Uncertainty by Fabio Cuzzolin
Change is possible: stories of women and minorities in mathematics by Patricia Clark Kenschaft, published by AMS, 2005 212 pages, softcover
Review of "Computational Complexity: a Quantitative Perspective by Marius Zimand", Elsevier, ISBN 0444828419
A review of DISC 2009
Distributed computing and the multicore revolution
List decoding: algorithms and applications
Review of design and analysis of randomized algorithms: introduction to design paradigms by Juraj Hromkovic (Published by Springer)
Review of The calculus of computation: decision procedures with applications to verification by Aaron R. Bradley and Zohar Manna
Is a solution to the 3x + 1 problem in sight?
Coordination mechanisms for congestion games
Guest column: the quantum PCP conjecture
Review of: Turing Computability: Theory and Applications by Robert Soare
SIGACT news online algorithms column 14
A new proof of undecidability of safety of logic queries
Game-theoretic aspects of distributed computing
Review of "Introduction to Lattices and Order by B. A. Davey and H. A. Priestley", Cambridge University Press
ACM SIGACT news distributed computing column 13
The halting problem
Review of people, problems, and proofs by Richard Lipton and Ken Regan
An NP-hard problem in bipartite graphs
Review of Theory of computational complexity by Ding-Zhu Du and Ker-I Ko. John Wiley & Sons
Visibility representations of planar graphs (abstract)
Education forum: digital geometry and its algorithms: an introduction
Parallel algorithms column 1: models of computation
On non-hierachical systems of binary operators
A simple NP-hard problem
Alternative Logics: a book review: SIGACT news logic column 18
Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series))
Contributions of theoretical computer science
Review of algebraic function fields and codes by Henning Stichtenoth
Guest column: error-correcting codes and expander graphs
A combinatorial approach to matrix theory and Its applications by Richard Brualdi and Dragos Cvetkovic, Published by Cambridge Press, 2009 824 pages, hardcover
SIGACT news complexity theory column 65
Infrastructure issues related to theory of computing research
Computational geometry column 46
SIGACT News Online Algorithms Column 44: 2025 in review
A recent technical report
Sybil defenses via social networks: a tutorial and survey
ACM SIGACT news distributed computing column 2
Security and composition of cryptographic protocols: a tutorial (part I)
Are all injective knapsacks partly solvable after multiplication modulo q?
Review of Deterministic Extraction from weak random sources by Ariel Gabizon
Distributed computing
Discrete mathematical problems with medical applications DIMACS volume 55
Database theory column: report on PODS 2009
Review of The Problem With Software: Why Smart Engineers Write Bad Code
Review of Problems with a Point: Exploring Math and Computer Science
Review of: Algorithms on Strings by Maxime Crochemore, Christophe Hancart and Thierry Lecroq
Review of "Classical and Quantum Computing with C++ and Java Simulations, by Yorick Hardy and Willi-Hans Steeb", Birkhauser Verlag, 2001
Data structures and algorithms using Python and C++ by David M. Reed and John Zelle Franklin, Beedle and Associates 2009
Guest Column: Proof Complexity and Beyond
Computational geometry column 41
The analysis of programming structure
Guest Column: Adiabatic Quantum Computing Challenges
Needed: foundations for transactional memory
SPAA 2017 Review
Education forum: loops and induction proofs
Open Problems: 13
SIGACT news complexity theory column 62
Combinatory automaton
Primitive recursion without implicit predecessor
ACM SIGACT news distributed computing column 11
The Difficulties of Addressing Interdisciplinary Challenges at theFoundations of Data Science
Automatic Synthesis of Distributed Protocols
SIGACT news online algorithms column 20: the power of harmony
Review of "Handbook of Graph Theory edited by Gross and Yellen." CRC, 2004
Review of applied combinatorics by Fred S. Roberts and Barry Tesman
DISC 2015 Review
A new approach to the first theory course
Review of selected papers on design of algorithms by Donald E. Knuth
Building reliable large-scale distributed systems: when theory meets practice
On converting on-line algorithms into real-time and on real-time algorithms for string-matching and palindrome recognition
Review of a programmer's companion to algorithm analysis by Ernst Leiss (Chapman & Hall/CRC, 2007)
Federal funding in computer science: a preliminary report
Review of: Incredible Numbers by Ian Stewart
Review of the block cipher companion by Lars R. Knudsen and Matthew J.B. Robshaw
Review of from zero to infinity: what makes numbers interesting by Constance Reid
Review of boolean functions: theory, algorithms, and applications by Yves Crama and Peter L. Hammer
Things a computer scientist rarely talks about
Report on PODS 2015
On the inference of canonical context-free grammars
On Rat ∔
A terminological proposal
Review of proofs from THE BOOK (4th edition) by Martin Aigner and Günter M. Ziegler
Theory of computation on abstract/concrete computer automata
Mathematical theory of domains
Parallel algorithms column: on the search for suitable models
Review of understanding and applying cryptography and data security by Adam J. Elbirt
Guest Column: Quantum Finite Automata: From Theory to Practice
Review of introduction to mathematics of satisfiability, by Victor W. Marek
Vague text compression
Approximating metrics by tree metrics
How close did Kurt Gödel get to the University of Wyoming?
Review of Communication Complexity and Applications by Anup Rao and Amir Yehudayoff
Online Algorithms with Advice: A Survey
Distributed computing column 47: distributed computability
How to Write a Good Project Report
Report on DISC'00
Review of Algebraic Coding Theory Revised Edition by Elwyn Berlekamp
The cycle burning problem
Relativizations of complexity classes
Fast parallel orthogonalization
The Hamiltonian circuit problem and automaton theory
Review of binary quadratic forms: an algorithmic approach by Johannes Buchmann and Ulrich Vollmer Springer 2007
60 Years of Mastering Concurrent Computing through Sequential Thinking
Guest Column: Average-case Complexity Through the Lens of Interactive Puzzles
Brief Introduction to Quantum Computing for Undergraduate Students: Lecture One
Worlds to Die Harder For Open Oracle Questions for the 21st Century
PODC 2019 Review
Guest column: testing linear properties: some general theme
Workshop on algorithm engineering: a report
On the smallest open Diophantine equations
Review of DISC 2010
An O(ln n) parallel algorithm for the subset sum problem
Polymorphism, objects and abstract types
A Note on Fault-tolerant Consensus in Directed Networks
Logic and language models for computer science
SIGACT news complexity theory column 40
SIGACT News Complexity Theory Column 124 Meta-Mathematics of Computational Complexity Theory
Review of flows in networks by L. R. Ford Jr. and D. R. Fulkerson
The construction of Huffman-equivalent prefix code in NC
Iterative vs. regular factor algebras
Distributed Computing Column 56 Annual Review 2014
Review of Essential Discrete Mathematics for Computer Science By Harry Lewis and Rachel Zax
SIROCCO 2015 Review
Some myths about famous mutual exclusion algorithms
Trusting the cloud
Review of: Distributed Computing Through Combinatorial Topology by Maurice Herlihy and Dmitry Kozlov and Sergio Rajsbaum
Review of An Introduction to Ramsey Theory: Fast Functions, Infinity, and Metamathematics by Matthew Katz and Jan Reimann
SIGACT News Online Algorithms Column 35: 2019 in review
Travelling through wormholes: a new look at distributed systems models
Book Review: Programs, Recursion and Unbounded Choice. By Wim H. Hesselink. (Cambridge University Press, 1992. xii+223 pages. ISBN 0-521-40436-3. $39 .95)
Distributed Computing Column 59: Resource-Competitive Algorithms
Review of: Handbook of Finite Fields by Gary L. Mullen and Daniel Panario
Is mathematics inevitable? a miscellany by Underwood Dudley (editor), The Mathematical Association of America, 2008 324 pages, hardcover
Teaching (and research) squeezed
Machine models and linear time complexity
Questions answered. in theory.: http://cstheory.stackexchange.com/
Review of "A Course in Computational Algebraic Number Theory by Henri Cohen, " Springer, 2000
Book Reviews: Logic for Applications by Anil Nerode and Richard A. Shore
Chases and escapes by Paul J. Nahin
Review of algorithmic cryptanalysis, by Antoine Joux
Distributed Computing Column 68
Review of Words and Graphs by Sergey Kitaev and Vadim Lozin
SIGACT News Complexity Theory Column 12
Remembrances of Alan
Report on IFIP'94
Book review: Gems of Theoretical Computer Science by Uwe Schöning and Randall Pruim (Springer-Verlag, 1998)
The complexity theory companion
Can parallel algorithms enhance serial implementation
Routing in distributed networks: overview and open problems
PODC 2020 Review
A language construct for "Dovetailing"
Review of in pursuit of the traveling salesman, by William J. Cook
Games of no chance (1998, edited by Richard Nowakowski) and more games of no chance (2002, edited by Richard Nowakowski) and games of no chance iii (2009, edited by Michael Albert and Richard Nowakowski published by cambridge press)
SIGACT News Online Algorithms Column 42
Computational Geometry Column 69
Review of rock, paper, scissors: game theory for everyday life by Len Fisher (Basic Books, 2008)
SIROCCO 2016 Review
Distributed computing column 41 computing over dynamic networks
Review of "Alfred Tarski: Life and Logic by Anita Burdman Feferman and Solomon Feferman", Cambridge University Press 2004
Sensitivity of probabilistic results on algorithms for NP-complete problems to input distributions
Computational geometry column 58
A bound on the shift function in terms of the Busy Beaver function
Book Review: Stable Marriage and its Relation to Other Combinatorial Problems: An Introduction to Algorithm Analysis by Donald E. Knuth (American Mathematical Society 1996)
Approximate solutions to problems in PSPACE
14th Knuth prize: call for nominations
Review of software abstractions: logic, language and analysis by Daniel Jackson M.I.T. Press, 2006
SIGACT news online algorithms column 21: APPROX and ALGO
Review of Theorems of the 21st Century: Volume I
Review of design of approximation algorithms, by David P. Williamson and David B. Shmoys
Computability in distributed computing: a Tutorial
Computational geometry column 37
PODC 2013 review
Abstracts from the computer science conference
SIGACT news complexity theory column 69
Computational geometry column 45
Making computation count: arithmetic circuits in the nineties
Convergence of simulated annealing-hastings
Education forum: trying again with MathML
Review of extremal combinatorics with applications to computer science (2nd edition) by Stasys Jukna
Modern computer algebra
Review of: Quantum Algorithms via Linear Algebra by Richard J. Lipton and Kenneth W. Regan
Review of not always buried deep: a second course in elementary number theory by Paul Pollack
Joint review of the honor class: Hilbert's problems and their solver by Ben Yandell and: Mathematical developments arising from Hilbert's problems edited by Felix Browder
Guest Column: The 7 faces of quantum NP
Experiments with a generic reduction computer
Review of The Age of Algorithms by Serge Abiteboul and Gilles Dowek
SIGACT News Complexity Theory Column 98
A short proof of the pigeon hole principle using extended resolution
Table-automata/ finite co-finite languages
Quantum computer science: an introduction author of book: N. David Mermin's publisher: cambridge press, 2007, 236 pages
Joint review of computational complexity: a conceptual perspective by Oded Goldreich published by Cambridge University Press, 2008 and computational complexity: a modern approach by Sanjeev Arora and Boaz Barak published by Cambridge University Press, 2009
Review of "The Algorithm Design Manual, 3 rd ed. by Steven S. Skiena Springer, 2020 793 pages, Hardcover, $99.99"
Emerging opportunities for theoretical computer science
Review of Modal logic: Cambridge tracts in theoretical computer science #53 by Patrick Blackburn, Maarten de Rijke, and Yde Venema. Cambridge University Press 2001
Distributed computing column 46: synthesizing distributed and concurrent programs
Iteration vs. Recursion: Two Basic Algorithm Design Methodologies
Resource-Competitive Algorithms
Review of PODC 2012
Review of creative mathematics by H.S. Wall
Theoretical aspects of dynamic distributed systems: report on the workshop, Elche, Spain, September 26, 2009
Loops in Algol 60 and in category theory
SIGACT News Online Algorithms Column 38: 2021 in review
A taxonomy of proof systems (part 2)
Review of "The Engines of Cognition: Essays by the Less Wrong Community by Less Wrong Less Wrong Press 720 pages, Year: 2019 $30.00"
DISC 2018 Review
Review of combinatorics: a problem oriented approach by Daniel A. Marcus
Review of pearls of discrete mathematics by Martin Erickson
Enumerative combinatorics
Inspecting continuations
Open Problems Column Edited by William Gasarch This Issue's Column!
ACM SIGACT news Distributed Computing Column 6
Review of "The Access Principle by John Willinsky, " MIT Press, 2005
Introduction to automata theory, languages, and computation, 2nd edition
Review of: Analysis of Boolean Functions by Ryan O'Donnell
Computational Geometry Column 24
SIGACT news online algorithms column 10: competitiveness via doubling
Review of "Complexity and real computation" by Blum, Cucker, Shub, and Smale. Springer-Verlag
Review of roots to research by Judith D. Sally and Paul J. Sally, Jr
Computational geometry column 59
SIGACT News Complexity Theory Column 117: Thirty Years of Complexity Theory (Columns)
The tree structure of exponential calculations
Review of "Mathematics of Physics and Engineering by Edward K. Blum and Sergey V. Lototsky, " World Scientific
Minutes of the 4th annual LICS business meeting
Review of DISC 2012
SIGACT News Complexity Theory Column 10
Review of An introduction to quantum computing algorithms by Arthur O. Pittenger. Birkhäuser 2000
Princeton University press, 2004 xxvi+372 pages
Distributed Computing Column 87 Distributed and Algorithmic Thinking across Domains
Database Theory Column Report on PODS 2019
Cryptographic applications of analytic number theory: lower bounds and pseudorandomness author of book: Igor Shparlinski Birkäuser, 2003
Review of: A Mathematical Orchard - Problems and Solutions by Mark Krusemeyer, George Gilbert, and Loren Larson
Database theory column: report on PODS 2006
Crusade for a better notation
The journal review column
Review of probably approximately correct by Leslie Valiant
ACM SIGACT news distributed computing column 5
Review of: Ramsey Theory over the Integers (Second Edition) by Bruce M. Landman and Aaron Robertson
Four colors suffice!
Review5 of algorithmic game theory: editors: Noam Nisan, Tim Roughgarden, Eva Tardos, Vijay V. Vazirani, publisher: Cambridge University Press ISBN: 978-0-521-87282-9