yusuke1997/dblp-id-title huggingface dataset:
Guest Column: Complexity of Verication in Abstract Argumentation Frameworks
Comments on the roots of theorems and languages both easy and hard
Review of iterative methods in combinatorial optimization by Lap Chi Lau, R Ravi and Mohit Singh
Review of Proofs and Refutations: author of book: Imre Lakatos
Database metatheory: asking the big queries
Guest Column: A Paradigm for Arithmetic Circuit Lower Bounds
Review of semantic techniques in quantum computation, edited by Simon Gay and Ian Mackie
SIGACT news logic column 14
Review of exact exponential algorithms by Fedor V. Fomin and Dieter Kratsch
SIGACT news online algorithms column 16
Planar NAE3SAT is in P
Computational geometry column 18
Review of introduction to cryptography by Hans Delfs and Helmut Knebl Publisher: Springer, 2007 ISBN: 978-3-540-49243-6
Distributed computing column 40: annual review 2010
Guest Column: The Third P=?NP Poll
Compact knapsacks are polynomially solvable
The Splendors and Miseries of Rounds
The un-merging problem
Review of the Cryptoclub: using mathematics to make and break secret codes by Janet Beissinger and Vera Pless
The complexity of the circularity problem for attribute grammars: a note on a counterexample for a simpler construction
Review of The Art of Computer Programming Fascicle 6 'Satisfiability' by Donald E. Knuth
Review of algebraic cryptanalysis by Gregory V. Bard
SIGACT news complexity theory column 82
Review of Cryptography: theory and practice, second edition by Douglas R. Stinson. CRC Press
SIGACT News Complexity Theory Column 94
The novel algorithm for determining the reachability in acyclic Petri nets
ACM SIGACT News distributed computing column 3
Computational Geometry Column 68
Ackermann and the superpowers
Chicago blues
Report on COMPLEXITY 1998
Going Backwards: Introductory Programming LAnguages
Review of "Mathematical Muffin Morsels - Nobody wants a small piece by William Gasarch, Erik Metz, Jacob Prinz, and Daniel Smolyak World Scientific, 2021 210 pages, Softcover, $59.99."
On-line bipartite matching made simple
Review of "Types and Programming Languages by Benjamin C. Pierce", MIT Press, 2002
SIGACT news online algorithms column 17
Some better results estimating the shift function in terms of busy beaver function
Learning context-free languages from their structured sentences
Recent results on the single-source shortest paths problem
A review of Selected Papers on Analysis of Algorithms: by Donald E. Knuth
NSF Announcements: Theory of Computing Program
Review of Kernelization: Theory of Parameterized Preprocessing by Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi
SIGACT news online algorithms column 19
ACM SIGACT news distributed computing column 22
Guest column: inapproximability results via Long Code based PCPs
Algebraic implementation of abstract data types: an announcement
PODC 2017 Review
Teaching Nondeterminism
Review of "Computational Techniques of the Simplex Method by István Maros", Kluwer Academic Publishers, 2003
Review of Compact Data Structures - a practical approach by Gonzalo Navarro
Introduction to languages and machines by Alan P. Parkes, publisher: Springer 2008
On NP-decomposable sets
Book Review: Algorithms and Programming: Problems and Solutions by Alexander Shen (Birkhauser Boston, 1997)
Molasses and theories of learning
Review of Data Structures and Algorithms in Java (2nd ed): Michael T Goodrich and Roberto Tamassia
Book Review: Predicate Transformer Semantics. By Ernest G. Manes. (Cambridge University Press, 1992, 233pp. ISBN 0-521-42036-9. $39.95)
The equality axioms are not independent
Review of: The Joy of Factoring by Samuel Wagstaff
Regularity preserving functions
Journals to Die For
Workshops offer mentoring opportunities
A Quarter-Century of Wait-Free Synchronization
On the time required to recognize properties of graphs: a problem
Review of Handbook of Combinatorics (in two Volumes) : edited by R. L. Graham, M. Grötschel, L. Lovász
Computational geometry column 43
Review of applied algebra: codes, ciphers and discrete algorithms, by Darel W. Hardy, Fred Richman, and Carol L. Walker
PCPs with small soundness error
3rd Highlights of Algorithms (HALG 2018)
Review of Geometric folding algorithms by authors: E.D. Demaine and J. O'Rourke
Review of What is College For?: The Public Purpose of Higher Education5 by Ellen Condliffe Lagemann and Harry Lewis
Guest Column: the second P =?NP poll
Column: Team Diagonalization
Distributed Computability: A Few Results Masters Students Should Know
Five Ways Not To Fool Yourself: Designing Experiments for Understanding Performance
Review of Systems that Learn (second edition) by Jain, Osherson, Royer, Sharma
SIGACT news online algorithms column 13: 2007 - an offine perspective
Database theory column: report on PODs '98
Parallel speedup of sequential machines: a defense of parallel computation thesis
Guest Column: Models of computation between decision trees and communication
On Developing New Models, with Paging as a Case Study
Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992)
Review of process algebra: equational theories of communicating processes by J. C. M. Baeten, T. Basten, and M. A. Reniers
SIGACT News complexity theory column 18
Technical reports
Computational geometry column 26
Review of The Scholar and the State: In Search of Van der Waerden by Alexander Soifer
Boolean matrix multiplication using only O(n log 2 7 log n) bit operations
Transactional memory: beyond the first two decades
Critique of some trends in the TCS community in light of two controversies
A moment of perfect clarity I: the parallel census technique
Review11 of the golden ticket: P, NP, and the search for the impossible by Lance Fortnow
Teaching automata theory with JFLAP
Raising NP lower bounds to parallel NP lower bounds
Distributed computing column 43: using social networks to overcome Sybil attacks
A proof of generalized induction
International business machines
Database Theory Column: Report on PODS 2024
Review of combinatorial optimization: packing and covering
SIGACT news complexity theory column 81
Review of The Foundations of Computability Theory (Second Edition) by Borut Robič
Review of how to prove it: a structured approach by Daniel J. Velleman (Cambridge University Press, 2006)
Review of Models of Conflict and Cooperation by Rick Gillman and David Housman
Review of analytic combinatorics in several variables by Robin Pemantle and Mark Wilson
Computational geometry column 36
Book review: Indiscrete Thoughts by Gina-Carlo Rota (Birkhauser, 1996)
ACM SIGACT news distributed computing column 15
Logic and databases: a response
Book review: A Theory of Objects by Martin Abadi and Luca Cardelli (Springer-Verlag, 1996): Series--Monographs in Computer Science
Review of A view from the top analysis, combinatorics and number theory by Alex Iosevich
Education forum: Web Enhanced Textbooks
Writing and editing complexity theory: tales and tools
SIGACT News Online Algorithms Column 41: 2023 in review
Distributed Computing Column 65: Automatic Synthesis of Distributed Protocols and SIROCCO 2016 Review
PODC 2015 Review
SIGACT News Complexity Theory Column 100
An overview of codes tailor-made for better repairability in networked distributed storage systems
Reviews of THREE books on Fair Division of Resources
Roots of the hardest context free language and other constructs
Animating algorithms with XTANGO
Regular languages do not form a lattice under GSM mappings
Review of cryptanalysis of RSA and its variants by Jason Hinek
Review of The LLL Algorithm Edited by Phong Q. Nguyen and Brigitte Vallée
Review of "Reasoning about Uncertainty by Joseph Y. Halpern." The MIT Press, 2003
What can be computed without communications?
Algorithmic problems in power management
Computational geometry column 54
SIGACT News Complexity Theory Column 90: Introduction to Complexity Theory Column 90
Review of Three Lectures on Complexity and Black Holes by Leonard Susskind
The geometric mean distance
Packet Scheduling: Plans, Monotonicity, and the Golden Ratio
SIGACT News Complexity Theory Column 86: Introduction to Complexity Theory Column 86
Quantum computing for computer scientists Noson S. Yanofsky and Mirco A. Mannucci, Cambridge University Press, 2008
Computational geometry column 27
Computational Geometry Column 29
SIGACT news complexity theory column 64
SIGACT News Online Algorithms Column 39
Structure and algorithms in the SINR wireless model
Reliability and responsibility
Reprints from computing reviews
A survey of linear programming in randomized subexponential time
CRA status of women column
Review of handbook of nature-inspired and innovative computing by Albert Y. Zomaya
Distributed computing column
Distributed Computing Column 57 Distributed Algorithms as Combinatorial Structures
Book Review: Action Refinement in Process Algebras. By Luca Aceto. (Cambridge University Press, 1992. ix+273pp. ISBN 0-521-43111-5. $49.95)
Joint Review of Quadratic Residues and Non-Residues by Steve Wright and The Quadratic Reciprocity Law by Oswald Baumgart Edited and translated by Franz Lemmermeyer
Review of A Map that Reflects the Territory: Essays by the LessWrong Community Author: LessWrong
ACM SIGACT News Distributed Computing Column 31: quantum computers meet distributed computing
Prize for innovation in distributed computing: awarded to Roger Wattenhofer
Concentration of measure for the analysis of randomized algorithms by Devdatt P. Dubhashi and Alessandro Panconesi Cambridge University Press, 2009
The quasilinear isomorphism challenge
EDUCATION FORUM: Lecture and Lab Syllabus for a Breadth-First Introductory Computer Science Course Sequence following the Data Structures and Algorithms Paradigm
A joint review of "Reality Conditions: Short Mathematical Fiction, by Alex Kasman", MAA 2005;"Numb3rs, TV show. CBS", Free. Currently running Fridays at 10: 00PM; "Mathematical Apocryphia: Stories and Annecdotes of Mathematicians and the Mathematical by Steven Kranz", MAA, 2002; "Mathematical Apocryphia Redux: More Stories and Annecdotes of Mathematicians and the Mathematical by Steven Kranz", MAA, 1999
On the Peeper's Voronoi diagram
Challenging students with creative assignments
SIGACT News Online Algorithms Column 43: 2024 in review
Itanium's new basic operation of fused multiply-add: theoretical explanation and theoretical challenge
Extremal problems in graph drawings (abstract)
A constructive proof of the countability of Σ *
Guest column: a casual tour around a circuit complexity bound
SPTCC 2019 Review
The Environmental Cost of Our Conferences: The CO2 Emissions due to Travel at PODC and DISC
A tutorial on amortized local competitiveness in online scheduling
SIGACT news complexity theory column 42
SIGACT News Complexity Theory Column 88/89: Introduction to Complexity Theory Column 88/89
Book Review: Semantics of Programming Languages: Structures and Techniques. By Carl A. Gunter. (MIT Press, 1992. xviii+419pp. ISBN 0-262-07143-6 $37.50)
Computational geometry column 52
Joint reviews of four articles
Splaying a search tree in preorder takes linear time
The busy beaver on a one-way infinite tape
Algorithms column: sublinear time algorithms
Distributed Computing Column 88 An Invitation to Local Algorithms
Review of: The Fascinating World of Graph Theory by Arthur Benjamin, Gary Chartrand and Ping Zhang
Review of "Introduction to the Design and Analysis of Algorithms by Ananay Levitin", Addison-Wesley
The Heisenberg uncertainty principle and the halting problem
The First Summer School on Practice and Theory of Concurrent Computing SPTCC 2017
Review of "Introduction to Coding Theory by Juergen Bierbrauer", Chapman and Hall/CRC, 2005, ISBN 1584884215
PODC 2018 Review
Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271
Review of type-logical semantics
Review of "Codes: The Guide to Secrecy from Ancient to Modern Times by Richard A. Mollin", Chapman & Hall/CRC, 2005
Strategic directions in research in theory of computing
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
Review of proofs and algorithms by Gilles Dowek (translation by Maribel Fernandez)
A test for fuzzy logic
A complexity-theoretic proof of a Recursion-Theoretic Theorem
Logical verification and equational verification
Algorithmic foundations of the internet
Experimental quantum cryptography: the dawn of a new era for quantum cryptography: the experimental prototype is working]
The effect of paged memory upon algorithm performance: short note
Education Forum: Java...H o t Java!: What is that Brewing on the Web?
Review of "Automated theorem proving: a logical basis" by D. W. Loveland. North-Holland Publishing Co. 1977
Guest Column: NP-complete problems and physical reality
Review of "A Computational Introduction to Number Theory and Algebra by Victor Shoup", Cambridge University Press, 2005
Review of Random graphs: (second edition) by Béla Bollobás
Representing problems as string transformations
Review of Combinatorial Optimization - Theory and Algorithms
Report of the 21st midwest theory consortium
Dynamic logic
Review of the mathematics of life by Ian Stewart
Comparative book review: Cryptography: An Introduction by V. V. Yaschenko (American Mathematical Society, 2002); Cryptanalysis of Number Theoretic Ciphers by S.S. Wagstaff, Jr. (Chapman & Hall/CRC Press, 2003); RSA and Public-Key Cryptography by R. A. Mollin (Chapman & Hall/CRC Press, 2003); Foundations of Cryptography, vol. 1: Basic Tools by O. Goldreich, (Cambridge University Press, 2001)
Review of How to Solve It: Modern Heuristics: Zbigniew Michalewicz and David B Fogel
Online List Scheduling for Makespan Minimization: A Review of the State-of-the-art Results, Research Challenges and Open Problems
Education Forum: Beware the Backlash: The Teaching vs. Research Conundrum Revisited
Saving tapes in the simulation of multihead turing machines
Cryptology - column 3 hot news on interactive protocols
Guest column: algebraic construction of projection PCPs
SIGACT News Online Algorithms Column 27: Online Matching on the Line, Part 1
Review of Reasoning About Knowledge by Ronald Fagin, Joseph Halpern, Yoram Moses and Moshe Verdi
Book review: Network Design: Connectivity and Facilities Location. Proceedings from DIMACS workshop in April-1997 (AMS 1998)
HALG: Highlights of Algorithms
Review of DISC 2008
Symbolic model checking for temporal-epistemic logics
SIROCCO 2017 Review
Review of integrated methods for optimization second edition, 2012 by John Hooker
A collection of kinesthetic learning activities for a course on distributed computing: ACM SIGACT news distributed computing column 26
ACM SIGACT news distributed computing column 33: teaching concurrency
Fault tolerant transaction architectures
A note on the functional estimation of values of hidden variables: an extended module for expert systems
Automata theory: what is it used for?
Review of Set Theory: A First Course by Daniel W. Cunningham
How To Answer It
Everything you wanted to know about the running time of Mergesort but were afraid to ask
Review of Handbook of Computational Social Choice Edited by Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel D. Procaccia
Database Theory Column Report on PODS 2021
Review of transitions and trees: an introduction to structural operational semantics, by Hans Hüttel
The princeton companion to mathematics by Timothy Gowers, June Barrow-Green and Imre Leader Princeton University Press, 2008
Distributed Computing Column 83 Five Ways Not To Fool Yourself: Designing Experiments for Understanding Performance
Review of "Automatic sequences: theory, applications, generalizations" by Jean-Paul Allouche and Jeffrey Shallit. Cambridge University Press
Review of pioneering women in american mathematics: the pre-1940 PhD's by Judy Green and Jeanne LaDuke
Review of basic phylogenetic combinatorics by Andreas Dress, Katharina T. Huber, Jacobus Koolen, Vincent Moulton and Andreas Spillner
A Church-Rosser theorem for graph grammars
Computational Geometry Column 62
On the necessity of cryptanalytic exhaustive search
Computational geometry column 32
Combinatorics of permutations
Review of graph structure and monadic second-order logic: a language-theoretic approach by Bruno Courcelle and Joost Engelfriet
Review of: Games and Mathematics: Subtle Connections by David Wells
Quantum computation and quantum communication: theory and experiments Author of book: Mladen Pavicic
Computational Geometry Column 66
Computational geometry column 28
Review of "Algorithm design: foundations, analysis and internet examples" by Michael T. Goodrich and Roberto Tamassia. John Wiley & Sons, Inc. 2001
Review of: Fundamentals of Parameterized Complexity by Rodney G. Downey and Michael R. Fellows
Complexity of approximation algorithms for combinatorial problems: a survey
Book Review: Intersection and Decomposition Algorithms for Planar Arrangements, by Pankaj K. Agarwal. (Cambridge University Press, Cambridge, 1991 . xvii+277 pp . $39.50 cloth. ISBN 0-521-40446-0)
Review of handbook of chemoinformatics algorithms by Faulon
ACM SIGACT news distributed computing column 20
Independence results in computer science
Education forum: Where Have all the Women Gone?
CSNET: a tool for researchers in theoretical computer science
Review of Online Computation and Competitive Analysis by Allan Borodin and Ran EI-Yaniv
Abstracts computing research laboratory
Distributed Computing Column 80: Annual Review 2020
Review of Modal and temporal properties of processes by Colin Stirling. Springer Verlag 2001
Moving heaven and earth: distances between distributions
Review quantum computing since democritus by Scott Aaronson
One-way functions in worst-case cryptography: algebraic and security properties are on the house
Review of the clausal theory of types
Education forum
Perspectives on database theory
Drawing compound digraphs and its application to an idea organizer (abstract)
Kolmogorov complexity leads to a representation theorem for idempotent probabilities (sigma-maxitive measures)
On the definition of "on-line" in job scheduling problems
Testing for semilattices
Algorithms on vector sets
Computational geometry column
Spanner's concurrency control
The complexity of fixed-parameter problems: guest column
Technical Report Column1
SIGACT News Online Algorithms Column 26: Bin packing in multiple dimensions
Review of Modern Cryptography and Elliptic Curves, A Beginner's Guide by Thomas R. Shemanske
The monotone and planar circuit value problems are log space complete for P
Big omega versus the wild functions
Some philosophical implications of information-theoretic computational complexity
Review of "Automata, languages, development" by A. Lindenmayer and G. Rozenberg. North Holland Publishing Co. 1976
Review of "Logic for Computer Scientists, by Uwe Schöning", Birkhauser, 1994
SIGACT news complexity theory column 75
Space-bounded probabilistic computation: old and new stories
Robert W Floyd, In Memoriam
Distributed computing column 45: what theory for transactional memory?
The computational complexity of the local postage stamp problem
On resetting DLBA's
Guest column: complexity dichotomies of counting problems
How hard are n2-hard problems?
Guest Column: Approximate Degree in Classical and Quantum Computing
Report on DIMACS seminar series
SIGACT News Online Algorithms Column 34: 2018 in review
Distributed computing column 50: distributing trusted third parties, innovation prize, and SIROCCO review
Proving PACELC
Open Problems 14
Distributed Computing Column 74 Survey of Recon gurable Data Center Networks
Book review of synchronization algorithms and concurrent programming by Gadi Taubenfeld (Pearson/Prentice Hall, 2006)
Review of polynomia and related realms by Dan Kalman
Algorithms for orthogonal drawings (abstract)
Review of algorithmic puzzles by Anany Levitin and Maria Levitin
Digital to analog conversion: a speculation
Report on Complexity 1997
Cryptology column
Database theory column report on Pods 2010
Review of foundations of logic and mathematics applications to computer science and cryptography by Yves Nievergelt
Review of ordered sets: an introduction
Review of Ramsey Theory for Discrete Structures by Hans Jürgen Prömel
Computational Geometry Column 63
Review of From Zero to Infinity by Constance Reid
Stability and theory
Teaching algorithms
Some open problems in computational molecular biology
SIGACT news complexity theory column 68
Eulogy: Michael (Misha) Alekhnovich 1978-2006
Review of: Primality Testing for Beginners by Lasse Rempe-Gillen and Rebecca Waldecker
A variant of a public key cryptosystem based on Goppa Codes
A note on sorting integers from a bounded range
Review of in pursuit of the unknown: 17 equations that changed the world by Ian Stewart
A review of SIROCCO 2012
SIGACT news algorithms column: computation in large-scale scientific and internet data applications is a focus of MMDS 2010
Review of practical optimization: algorithms and engineering applications by Andreas Antoniou and Wu-Sheng Lu (Springer Verlag, 2007)
SIGACT news complexity theory column 34
Review of "The Game's Afoot: Game Theory in Myth and Paradox by Alexander Mehlmann", American Mathematical Society, 2000, 0-8218-2121-0
Intersection of Regular Languages and State Complexity
Review of 1 The Discrete Mathematical Charms of Paul Erdos A Simple Introduction by Vasek Chvatal
Review of "Selected Papers in Discrete Mathematics by D. Knuth", CSLI (Center for the Study of Language and Information Publication) paperback, $72.00
Guest Column: Parallel Algorithms for Perfect Matching
SIGACT news online algorithms column 24: 2014 so far
Review of Introduction to Bio-Ontologies by Peter N. Robinson and Sebastian Bauer
SIGACT news complexity theory column 80
Report on PODS'95
Distributed Computing Column 89 A Review of PODC 2025
Review of "The classical decision problem" by Egon Börger, Erich Grädel and Yuri Gurevich. Springer-Verlag 1997
Review of Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles by Denis Hirschfeldt
Review of Algorithms on strings by Dan Gusfield
On the state complexity of intersection of regular languages
SIGACT News Complexity Theory Column 103
How to present a paper on experimental work with algorithms
A Brief History of SIGACT News and its Editors
Undaunted sets (extended abstract)
SIGACT news complexity theory column 52
SIGACT News Complexity Theory Column 119
Finite types, exponential forms and complete trees
Regular languages under F-gsm mappings
SIGACT salary survey
SIGACT news complexity theory column 43
Review of handbook of large-scale random networks by Bela Bollobás, Robert Kozma and Deszö Miklós
Report on PODS 2012
Distributed Computing Column 81: Byzantine Agreement with Less Communication: Recent Advances
Review of variable-length codes for data compression by David Salomon
DISC 2017 Review
What is a "pointer machine"?
The byzantine empire in the intercloud
EDUCATION FORUM: Reflections on Turning Fifty
Review of The Structure and Stability of Persistence Modules by Frédéric Chazal, Vin de Silva, Marc Glisse, and Steve Oudot
Lambda Calculi: A Guide for Computer Scientists by Chris Hankin
How to gracefully number certain symmetric trees
A forgotten connection between tag-systems and parallel-rewriting
Guest Column: Non-abelian Combinatorics and Communication Complexity
Distributed Computing Column 76: Annual Review 2019
Review of theoretical aspects of local search by Wil P. A. J. Michiels, Emile H. L. Aarts, and Jan H. M. Korst (Springer in the EATCS Series Monographs in Theoretical Computer Science, 007)
Book Review: Finite Automata, Formal Logic, and Circuit Complexity. By Howard Straubing. (Birkhauser. 1994. xii+226pp. ISBN 0-8176-3719-2. $39.50.)
How reductions to sparse sets collapse the polynomial-time hierarchy: a primer: Part II restricted polynomial-time reductions
Using LATEX
Guest Column: Local Testing and Decoding of High-Rate Error-Correcting Codes
Review of discrete and computational geometry by Satyan L. Devadoss and Joseph O'Rourke
The mathematics of voting and elections: a hands-on approach by Jonathan K. Hodge and Richard E. Klima american mathematical society (mathematical world series, volume 22) 226 + xiv pages