yusuke1997/dblp-id-title huggingface dataset:
Proceedings of the First International Workshop on Security and Rewriting Techniques, SecReT@ICALP 2006, Venice, Italy, July 15, 2006
Clustering in the Boolean Hypercube in a List Decoding Regime
Syntactic Semigroups of Some Classes of Star-Free Languages
About Primitive Recursive Algorithms
Towards Optimal Multiple Selection
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
Non Interference for the Analysis of Cryptographic Protocols
Logic and Automata: A Match Made in Heaven
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
Lower Bounds for Circuits with Few Modular and Symmetric Gates
Triangle Counting with Local Edge Differential Privacy
On Sums of Roots of Unity
On the Distributional Complexity of Disjontness
Dynamic Averaging Load Balancing on Arbitrary Graphs
Packing Cycles Faster Than Erdos-Posa
Strong Approximations and Irrationality in Financial Networks with Derivatives
A Categorical Model for the Geometry of Interaction
On the Structure of Complexity Classes
Polynomial-Time Rademacher Theorem, Porosity and Randomness
Semicomputable Geometry
Minimum Fill-In on Circle and Circular-Arc Graphs
B and D Are Enough to Make the Halpern-Shoham Logic Undecidable
Ultra-Fast Load Balancing on Scale-Free Networks
Recent Advances for a Classical Scheduling Problem
All Quantum Adversary Methods Are Equivalent
Induced Disjoint Paths Without an Induced Minor
Better Algorithms for Minimizing Average Flow-Time on Related Machines
New Collapse Consequences of NP Having Small Circuits
Tree Algebras and Bisimulation-Invariant MSO on Finite Graphs
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks
Simultaneously Approximating All Norms for Massively Parallel Correlation Clustering
Local Search: Simple, Successful, But Sometimes Sluggish
On the Learnability of DNF Formulae
Knapsack Secretary with Bursty Adversary
Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds
Finite-Memory Strategies for Almost-Sure Energy-MeanPayoff Objectives in MDPs
Boundedness of Conjunctive Regular Path Queries
Parameterized Sensitivity Oracles and Dynamic Algorithms Using Exterior Algebras
Optimal Query Complexity for Estimating the Trace of a Matrix
Preprocessing of Min Ones Problems: A Dichotomy
Partial-Congruence Factorization of Bisimilarity Induced by Open Maps
Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms
Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time
FO Model Checking of Interval Graphs
Compactness of Systems of Equations in Semigroups
Finding a Path of Superlogarithmic Length
How Hard Is Counting Triangles in the Streaming Model?
Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
The Complexity of Bounded Context Switching with Dynamic Thread Creation
A New Approach to Formal Language Theory by Kolmogorov Complexity (Preliminary Version)
Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I
Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks
Automata For Modeling Real-Time Systems
Improved Garbled Circuit: Free XOR Gates and Applications
Improved Bounds for Shortest Paths in Dense Distance Graphs
Bounds on the Efficiency of "Black-Box" Commitment Schemes
Basing Cryptographic Protocols on Tamper-Evident Seals
Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games
Protecting Single-Hop Radio Networks from Message Drops
A Decidability Result for Sequential Grammars
Can Graph Grammars Make Formal Methods More Human?
A Compositional Reformulation of Owicki-Gries's Partial Correctness Logic for a Concurrent While Language
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures
Observations about the Nature and State of Computer Science (Keynote Address)
No Polynomial Kernels for Knapsack
Consequences of Faster Alignment of Sequences
Admissiblity in Concurrent Games
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
Generic Construction of Hybrid Public Key Traitor Tracing with Full-Public-Traceability
An Intrinsic Semantics of Intersection Types
On the Two-Dimensional Knapsack Problem for Convex Polygons
Sensitive Instances of the Constraint Satisfaction Problem
Approximate Convex Hull of Data Streams
On the Determinization of Weighted Finite Automata
LL(k) Parsing for Attributed Grammars
Optimal Resilient Sorting and Searching in the Presence of Memory Faults
An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version)
Equivalence and Membership Problems for Regular Trace Languages
Cut-Preserving Vertex Sparsifiers for Planar and Quasi-Bipartite Graphs
An Effective Tableau System for the Linear Time µ-Calculus
A Parallel Vertex Insertion Algorithm For Minimum Spanning Trees
Asymptotically Optimal Distributed Consensus (Extended Abstract)
On the Power of Chain Rules in Context Free Grammars
Type Structure for Low-Level Programming Languages
A Better Algorithm for Random k -SAT
Do Probabilistic Algorithms Outperform Deterministic Ones?
New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs
Skew and Infinitary Formal Power Series
Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes
A Universal Ordinary Differential Equation
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
Typed Exeptions and Continuations Cannot Macro-Express Each Other
Annotations in Data Streams
Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration
Fully Scalable MPC Algorithms for Euclidean k-Center
Improved Mixing for the Convex Polygon Triangulation Flip Walk
Edit Distance between Unrooted Trees in Cubic Time
A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem
Geometric Multicut
Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
Cumulative Memory Lower Bounds for Randomized and Quantum Computation
Space-Restricted Attribute Grammars
An Order out of Nowhere: A New Algorithm for Infinite-Domain {CSP}s
Implementation of Parameterised Specifications (Extended Abstract)
Une suite decroissante de cônes rationnels
Simple Permutations Mix Well
Lower Time Bounds for Randomized Computation
Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs
Counting Homomorphisms in Plain Exponential Time
Hierarchic Index Sequential Search with Optimal Variable Block Size and Its Minimal Expected Number of Comparisons
When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time
Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract)
A New Combinatorial Approach for Sparse Graph Problems
Spectral Sparsification via Bounded-Independence Sampling
Near-Optimal Algorithms for Stochastic Online Bin Packing
Efficient Data Structures for Incremental Exact and Approximate Maximum Flow
Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract)
Geometry of Online Packing Linear Programs
Bisimulation Equivalence of First-Order Grammars
Optimal Quantum Algorithm for Polynomial Interpolation
On the Power of Random Access Machines
Envy-Free Pricing in Multi-item Markets
Towards an Algebraic Theory of Typed Mobile Processes
Robust Algorithms Under Adversarial Injections
On the Chromatic Number of Random Graphs
Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP
On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs
Resource Access and Mobility Control with Dynamic Privileges Acquisition
Automata, Languages and Programming, 10th Colloquium, Barcelona, Spain, July 18-22, 1983, Proceedings
Verification of Population Protocols with Unordered Data
On Adaptive Algorithms for Maximum Matching
Low-Temperature Sampling on Sparse Random Graphs
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
Fine-Grained Complexity Analysis of Two Classic TSP Variants
Limitations of Local Quantum Algorithms on Random MAX-k-XOR and Beyond
Dynamic PageRank: Algorithms and Lower Bounds
Succinct Ordinal Trees Based on Tree Covering
The Serializability of Network Codes
Brief Announcement: MapReduce Algorithms for Massive Trees
Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract)
Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct
Faster Minimization of Tardy Processing Time on a Single Machine
Compound Logics for Modification Problems
Bracketed Two-Level Grammars - A Decidable and Practical Approach to Language Definitions
Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
Integer Linear-Exponential Programming in NP by Quantifier Elimination
Relative-Error Testing of Conjunctions and Decision Lists
Property Testing of LP-Type Problems
Perfect Information Stochastic Priority Games
Dynamic Longest Common Substring in Polylogarithmic Time
Minimizing Rosenthal Potential in Multicast Games
Computation Tree Logic for Synchronization Properties
Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words
Backdoors to Acyclic SAT
A Syntactic Characterization of Distributive LTL Queries
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing
Sensitivity Conjecture and Log-Rank Conjecture for Functions with Small Alternating Numbers
Secure Function Collection with Sublinear Storage
Knuth-Bendix Constraint Solving Is NP-Complete
Query-To-Communication Lifting for BPP Using Inner Product
The Arboricity Captures the Complexity of Sampling Edges
The Ultimate Signs of Second-Order Holonomic Sequences
Weakly Approximating Knapsack in Subquadratic Time
Optimistic Asynchronous Atomic Broadcast
Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
Terminal Algebra Semantics and Retractions for Abstract Data Types
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems
Automata, Circuits, and Hybrids: Facets of Continuous Time
The Non-Uniform k-Center Problem
A PTAS for Distinguishing (Sub)string Selection
Constructing Big Trees from Short Sequences
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
A Simple Method for Resolving Degeneracies in Delaunay Triangulations
Relations between Local and Global Periodicity of Words
Omega-Continuous Semirings, Algebraich Systems and Pushdown Automata
Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k
Circular Expressions: Elimination of Static Environments
Logical Rules of Natural Reasoning about Programs
Alternating Multihead Finite Automata (Extended Abstract)
Nondeterministic Tree-Walking Automata Are Not Closed Under Complementation
The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation)
Infinite Series-Parallel Posets: Logic and Languages
An Optimal Decomposition Algorithm for Tree Edit Distance
Fast Distributed Computation of Cuts Via Random Circulations
Dismantlability, Connectedness, and Mixing in Relational Structures
Convex Languages
Languages of Nilpotent and Solvable Groups (Extended Abstract)
Finite-State Dimension and Real Arithmetic
On Reversible Transducers
Coordination Mechanisms for Selfish Routing over Time on a Tree
Price of Stability in Polynomial Congestion Games
On the Complexity of Hazard-Free Formulas
Total Space in Resolution Is at Least Width Squared
The Value Problem for Multiple-Environment MDPs with Parity Objective
Fair Subtyping for Open Session Types
Local Search Breaks 1.75 for Graph Balancing
Deciding History Preserving Bisimilarity
The Complexity of Planar Boolean #CSP with Complex Weights
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs
Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the pi -Calculus
Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings
A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version)
Improving Known Solutions is Hard
An Improved Approximation Algorithm for Minimum-Cost Subset k -Connectivity - (Extended Abstract)
On the Power of Deterministic Mechanisms for Facility Location Games
The Range of Topological Effects on Communication
Parameterised Linearisability
Dominoes and the Regularity of DNS Splicing Languages
An Iteration Theorem for Simple Precedence Languages (Extended Abstract)
Grammatical Families
Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency
A Dichotomy for Succinct Representations of Homomorphisms
Optimal Parallel Algorithms for Prefix Matching
On the Diameter of Hyperbolic Random Graphs
Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings
On the Impossibility of Extracting Classical Randomness Using a Quantum Computer
Improved Sublinear-Time Edit Distance for Preprocessed Strings
On the Complementation of Büchi Asynchronous Cellular Automata
Tight Bounds for the Cover Time of Multiple Random Walks
FPTAS for Weighted Fibonacci Gates and Its Applications
Fast Integer Merging on the EREW PRAM
A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs
No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem
Additive Spanner Lower Bounds with Optimal Inner Graph Structure
On Isoperimetric Profiles and Computational Complexity
Determining the Separation of Preprocessed Polyhedra - A Unified Approach
Head Recurrent Terms in Combinatory Logic: A Generalization of the Notion of Head Normal Form
Rerouting Planar Curves and Disjoint Paths
Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes
Improving the Round Complexity of VSS in Point-to-Point Networks
A New Approach to Detection of Locally Indicative Stability
An Effective Version of Stallings' Theorem in the Case of Context-Free Groups
Arthur-Merlin Streaming Complexity
Constant-Round Private Database Queries
Computing Equilibrium Prices in Exchange Economies with Tax Distortions
On Revenue Maximization for Agents with Costly Information Acquisition - Extended Abstract
Optimal Two-Dimensional Compressed Matching
Polynomially Ambiguous Probabilistic Automata on Restricted Languages
Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform
On a Network Generalization of the Minmax Theorem
New Applications of the Incompressibility Method
A New Impossibility Result for Online Bipartite Matching Problems
From Linear to Additive Cellular Automata
Streaming Algorithms for Independent Sets
Some Further Results on Digital Search Trees
Sublinear Algorithms for TSP via Path Covers
Families with Infants: A General Approach to Solve Hard Partition Problems
Exponential Lower Bounds for Policy Iteration
Covert Computation in Self-Assembled Circuits
Power of Quantum Computation with Few Clean Qubits
Non-Uniform Attacks Against Pseudoentropy
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts
Negation Elimination from Simple Equational Formulae
On the (Generalized) Post Correspondence Problem with Lists of Length 2
(Re)packing Equal Disks into Rectangle
Complexity-Theoretic Limitations on Blind Delegated Quantum Computation
On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface
Computing Game Metrics on Markov Decision Processes
Approximations of Isomorphism and Logics with Linear-Algebraic Operators
A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One
Anonymous Card Shuffling and Its Applications to Parallel Mixnets
Reconstructing Decision Trees
Algorithms for Hub Label Optimization
Approximating Huffman Codes in Parallel
A Generalization of Cobham's Theorem to Automata over Real Numbers
Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Automata-Theoretic Characterisations of Branching-Time Temporal Logics
A PTAS for Embedding Hypergraph in a Cycle (Extended Abstract)
Planar Maps and Airy Phenomena
Parameterized Applications of Symbolic Differentiation of (Totally) Multilinear Polynomials
Oriented Equational Clauses as a Programming Language
Complexity of Approximate Conflict-Free, Linearly-Ordered, and Nonmonochromatic Hypergraph Colourings
Semantics and Proof Theory of Pascal Procedures
Finding the Smallest H -Subgraph in Real Weighted Graphs and Related Problems
Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems
On Word and Frontier Languages of Unsafe Higher-Order Grammars
A Complete Quantitative Axiomatisation of Behavioural Distance of Regular Expressions
New Extremal Bounds for Reachability and Strong-Connectivity Preservers Under Failures
A Timed Model for Communicating Sequential Processes
Demand Queries with Preprocessing
Constraint Satisfaction Parameterized by Solution Size
Parsing and Syntactic Error Recovery for Context-Free Grammars by Means of Coarse Structures
Existential Quantifiers in Abstract Data Types
Pumping Lemma for Higher-order Languages
Random Sampling from Boltzmann Principles
Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions
Bounded Depth Arithmetic Circuits: Counting and Closure
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications
Internet Ad Auctions: Insights and Directions
Cache-Oblivious Planar Shortest Paths
Algebraic Recognition of Regular Functions
Succinct Representations of Permutations
On the Structure of Combinatorial Problems and Structure Preserving Reductions
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs
A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n 1+1/k ) Size in Weighted Graphs
Reachability Games on Extended Vector Addition Systems with States
Model Checking and Strategy Synthesis for Stochastic Games: From Theory to Practice
Semantics of Unbounded Nondeterminism
Quelques applications des automates à arbres infinis
Randomized Rumor Spreading in Dynamic Graphs
One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
Parameterized Algorithms for Zero Extension and Metric Labelling Problems
Networks of Complements
A Partial Solution for D-Unification Based on a Reduction to AC1-Unification
Equivalence of Finite-Valued Streaming String Transducers Is Decidable
Signaling P Systems and Verification Problems
Two Versus One Index Register and Modifiable Versus Non-modifiable Programs
The Parallel Simplicity of Compaction and Chaining
Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime
Theory of Data Structures by Relational and Graph Grammars
Languages with Homomorphic Replacements
Faster Algorithms for Semi-matching Problems (Extended Abstract)
Design of Dynamic Algorithms via Primal-Dual Method
Interpreting Tree-to-Tree Queries
Querying the Guarded Fragment with Transitivity
Removable Online Knapsack Problems
On the Optimal Assignment of Attributes to Passes in Multi-Pass Attribute Evaluators
Average Case Complexity Analysis of the Rete Multi-Pattern Match Algorithm
An Efficient Coding Theorem via Probabilistic Representations and Its Applications
Further Improvements in Competitive Guarantees for QoS Buffering
Parameterized Tractability of Multiway Cut with Parity Constraints
Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph
Self-assembly with Geometric Tiles
Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings
When Conflicting Constraints Can Be Resolved - The Lovász Local Lemma and Satisfiability
Nash Equilibria in Discrete Routing Games with Convex Latency Functions
A Fair Protocol for Signing Contracts (Extended Abstract)
Algebraic Properties of Idempotent Substitutions
A Modification of the Lambda-Calculus as a Base for Functional Programming Languages
Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs
Comparing Recursion, Replication, and Iteration in Process Calculi
Program Composition and Modular Verification
Treewidth Computation and Extremal Combinatorics
Dynamic Compressed Strings with Random Access
An Adaptive Spectral Heuristic for Partitioning Random Graphs
Problems on RNA Secondary Structure Prediction and Design
Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System
A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem
Optimal Net Surface Problems with Applications
The Topology of Local Computing in Networks
Fast Reed-Solomon Interactive Oracle Proofs of Proximity
Efficient Zero Knowledge on the Internet
Stochastic k-Server: How Should Uber Work?
(Semi)-separability of Finite Sets of Terms in Scott's D_infty-Models of the lambda-Calculus
Inference Systems with Corules for Fair Subtyping and Liveness Properties of Binary Session Types
Do We Really Need to Balance Patricia Trees? (Extended Abstract)
Greedy Algorithms for Online Survivable Network Design
Size Competitive Meshing Without Large Angles
Truthful Allocation in Graphs and Hypergraphs
Products of Finite State Machines with Full Coverage
Completely Non-malleable Schemes
Resource Oblivious Sorting on Multicores
Inapproximability Results for Equations over Finite Groups
Nearly Linear-Time Model-Based Compressive Sensing
A Simple Model of Separation Logic for Higher-Order Store
Zero-One Rounding of Singular Vectors
Conditional Dichotomy of Boolean Ordered Promise CSPs
Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹
A General Stabilization Bound for Influence Propagation in Graphs
Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input
Efficiency Guarantees in Auctions with Budgets
Realizability and Verification of MSC Graphs
Partitioning Point Sets in 4 Dimensions
Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation
Generalized Finiteness Conditions of Labelled Transition Systems
A Counterexample to Thiagarajan's Conjecture on Regular Event Structures
Weak Alternating Timed Automata
Non-Linear Paging
Hardness Results for Constant-Free Pattern Languages and Word Equations
Sum-Of-Squares Bounds via Boolean Function Analysis
Towards the Graph Minor Theorems for Directed Graphs
Short Proofs of the Kneser-Lovász Coloring Principle
The Long Arm of Nashian Allocation in Online p-Mean Welfare Maximization
Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete
Characterizations of Time-Bounded Computations by Limited Primitive Recursion
Sort Me If You Can: How to Sort Dynamic Data
Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints
Structural Equivalence of Context-Free Grammar Forms is Decidable
Unit Interval Editing is Fixed-Parameter Tractable
Streaming Communication Protocols
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games
Monadic Simultaneous Rigid E-Unification and Related Problems
Fast Deterministic Backtrack Search
Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach
Principality Results About Some Matrix Languages Families
Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median
A Finite Basis for Failure Semantics
Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I
Better Sparsifiers for Directed Eulerian Graphs
Password-Based Encryption Analyzed
Hrushovski's Encoding and ω-Categorical CSP Monsters