yusuke1997/dblp-id-title huggingface dataset:
A Structure Theorem for Poorly Anticoncentrated Gaussian Chaoses and Applications to the Study of Polynomial Threshold Functions
Quadratic Dynamical Systems (Preliminary Version)
Structural Equivalence and LL-k Grammars
Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs
Metric Embeddings with Relaxed Guarantees
Weighted k-Server Bounds via Combinatorial Dichotomies
Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs
Robust Separations in Inductive Inference
Shrinkage of de~Morgan formulae under restriction
A Notion of Helping and Pseudo-Complementation in Lattices of Honest Subrecursive Classes
Optimal Las Vegas Locality Sensitive Data Structures
Compact Oracles for Reachability and Approximate Distances in Planar Digraphs
Estimating the Distance from Testable Affine-Invariant Properties
A linear-time approximation scheme for planar weighted TSP
Limitations of Randomized Mechanisms for Combinatorial Auctions
Faster Algorithms for Rectangular Matrix Multiplication
Asynchronous Propagation-Limited Logic
The Localization Problem for Mobile Robots
An Average-Case Depth Hierarchy Theorem for Higher Depth
Computing Multiplicities of Lie Group Representations
11th Annual Symposium on Switching and Automata Theory, Santa Monica, California, USA, October 28-30, 1970
Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time
Lazy Search Trees
Equivalence between Priority Queues and Sorting
Modular synthesis of sequential machines
Constant Approximation for Private Interdependent Valuations
Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems
Equality Languages, Fixed Point Languages and Representations of Recursively Enumerable Languages
On Basing Lower-Bounds for Learning on Worst-Case Assumptions
Economy of Description by Automata, Grammars, and Formal Systems
49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, Philadelphia, PA, USA, October 25-28, 2008
Dynamic Word Problems
Efficient Parallel Algorithms for Chordal Graphs
Network Coding Gaps for Completion Times of Multiple Unicasts
Lipschitz Continuous Algorithms for Graph Problems
On the Average-case Complexity of Selecting k-th Best
Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time
The Inherent Complexity of Dynamic Data Structures which Accommodate Range Queries
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems
Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m 1.31 )
Symmetry and Approximability of Submodular Maximization Problems
A fast approximation for minimum spanning trees in k-dimensional space
Faster Approximate Agreement with Multi-Writer Registers
Fast Modular Transforms via Division
Canonical forms of functions in P-valued logics
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance
Computing Permanents over Fields of Characteristic 3: Where and Why It Becomes Difficult (extended abstract)
The Cover Time, the Blanket Time, and the Matthews Bound
Contextual Search via Intrinsic Volumes
A direct product theorem for quantum communication complexity with applications to device-independent QKD
A survey of asynchronous logic: Comparing various definitions and models for asynchronous switching circuits
The Access Network Design Problem
On the Structure of Programming Languages, or, Six Languages for Turing Machines
On single-loop realizations of automata
On a Geometric Generalization of the Upper Bound Theorem
Fully Dynamic Biconnectivity and Transitive Closure
Short Presburger Arithmetic Is Hard
Choice-Memory Tradeoff in Allocations
A Linear Time Algorithm for the Lowest Common Ancestors Problem (Extended Abstract)
38th Annual Symposium on Foundations of Computer Science, FOCS 1997, Miami Beach, Florida, USA, October 19-22, 1997
Sequential Rationality in Cryptographic Protocols
Beating the Integrality Ratio for s-t-Tours in Graphs
A Tight Analysis of Bethe Approximation for Permanent
Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics
On the application of pair algebra to automata theory
On Linear Characterizations of Combinatorial Optimization Problems
Exact Identification of Circuits Using Fixed Points of Amplification Functions (Extended Abstract)
A Polynomial Time Algorithm for Fault Diagnosability
Randomized Simplex Algorithms on Klee-Mintny Cubes
Learning Sums of Independent Random Variables with Sparse Collective Support
Realization of Sequential Machines with Threshold Elements
How to Refute a Random CSP
Worst Case to Average Case Reductions for Polynomials
Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs
A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization
Universal Blind Quantum Computation
Geometry of Secure Two-party Computation
Edge-Disjoint Paths in Planar Graphs
Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents
Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems
A Really Temporal Logic
Local Search Yields a PTAS for k-Means in Doubling Metrics
Large Deviation Bounds for Decision Trees and Sampling Lower Bounds for AC0-Circuits
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n log log n)
Efficient Tree Pattern Matching (Preliminary Version)
Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries
Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design
Feedback in asynchronous sequential circuits
Fast Mixing in Sparse Random Ising Models
On Maximally Parallel Schemata
Testing of Clustering
A Theorem on Polygon Cutting with Applications
Jump Operators, Interactive Proofs and Proof Complexity Generators
Algorithmic Techniques and Tools from Computational Geometry
An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees
Properly learning decision trees with queries is NP-hard
A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems
Bounded-Communication Leakage Resilience via Parity-Resilient Circuits
On Interpolation by Analytic Functions with Special Properties and Some Weak Lower Bounds on the Size of Circuits with Symmetric Gates
Fast algorithms for constructing t-spanners and paths with stretch t
On small-depth Frege proofs for PHP
Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers
Motion Planning on a Graph (Extended Abstract)
Reliability and fault-masking in n-variable NOR trees
Deterministic context free languages
Solvability in Asynchronous Environments (Extended Abstract)
Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification
A Scheduling Model for Reduced CPU Energy
Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic stochastic localization
58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017
Near-Optimal Time-Space Tradeoff for Element Distinctness
Deterministic Context-Sensitive Languages
Better Expansion for Ramanujan Graphs
Designing FPT Algorithms for Cut Problems Using Randomized Contractions
On the Computational Complexity of the Permanent (Extended Abstract)
A Complete Promise Problem for Statistical Zero-Knowledge
Streaming Lower Bounds and Asymmetric Set-Disjointness
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball
Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval
Improved Inaproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring
On the Value of Multiple Read/Write Streams for Approximating Frequency Moments
Time-Space Bounds for Directed s-t Connectivity on JAG Models (Extended Abstract)
Lower Bounds on Near Neighbor Search via Metric Expansion
Trading Determinism for Noncommutativity in Edmonds' Problem
Tight Complexity Bounds for Parallel Comparison Sorting
The Typed lambda-Calculus Is not Elementary Recursive
A Hitting Set Relaxation for $k$-Server and an Extension to Time-Windows
Characterizations of Locally Testable Events
Monochromatic Triangles, Triangle Listing and APSP
4th Annual Symposium on Switching Circuit Theory and Logical Design, Chicago, Illinois, USA, October 28-30, 1963
Machine Learning: My Favorite Results, Directions, and Open Problems
Lower Bounds for Pseudorandom Number Generators
On the Advantage over Random for Maximum Acyclic Subgraph
On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract)
A Deterministic View of Random Sampling and its Use in Geometry
Game Theory and Mathematical Economics: A Theoretical Computer Scientist's Introduction
Variable-Version Lovász Local Lemma: Beyond Shearer's Bound
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
Super-Logarithmic Lower Bounds for Dynamic Graph Problems
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
Demystifying the border of depth-3 algebraic circuits
Reversal-Bounded Multi-Pushdown Machines: Extended Abstract
Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-Random Graphs
New Classes and Applications of Hash Functions
Fast Modular Composition in any Characteristic
Single Pass Precedence Analysis (Extended Abstract)
Randomness Buys Depth for Approximate Counting
Automaton Analogs of Syntax Directed Translation Schemata
SNARGs for $\mathcal{P}$ from LWE
On the Existence of Seedless Condensers: Exploring the Terrain
A Characterization of \sharp P Arithmetic Straight Line Programs
Randomness Extractors and their Many Guises
The product replacement algorithm is polynomial
Removing Randomness in Parallel Computation Without a Processor Penalty
Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation
Spectral Partitioning Works: Planar Graphs and Finite Element Meshes
5th Annual Symposium on Switching Circuit Theory and Logical Design, Princeton, New Jersey, USA, November 11-13, 1964
On a General Method for Maximizing and Minimizing among Certain Geometric Problems (Extended Abstract)
The Multiplicative Complexity of Quadratic Boolean Forms
Area Penalty for Sublinear Signal Propagation Delay on Chip (Preliminary Version)
Positive Results for Concurrently Secure Computation in the Plain Model
The Symmetric Group Defies Strong Fourier Sampling
An Application of Graph Coloring to Printed Circuit Testing (Working Paper)
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling
Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
The Least Weight Subsequence Problem (Extended Abstract)
LP-Based Algorithms for Capacitated Facility Location
Inclusion--Exclusion Algorithms for Counting Set Partitions
Making the Long Code Shorter
Transparent categories and categories of transition systems
Top-Down Lower Bounds for Depth-Four Circuits
How to Use Heuristics for Differential Privacy
An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups
Perfect Information Leader Election in log* n + O (1) Rounds
The Promise of Differential Privacy: A Tutorial on Algorithmic Techniques
Structural Equivalence of Automata
PanORAMa: Oblivious RAM with Logarithmic Overhead
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors
Parallel Algorithms for Permutation Groups and Graph Isomorphism
A TDI System and its Application to Approximation Algorithms
Krylov Methods are (nearly) Optimal for Low-Rank Approximation
Fault Detection in a Linear Cascade of Identical Machines
Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary)
An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs
Process Logic: Expressiveness, Decidability, Completeness
Faster Matroid Intersection
Expander Graphs - Both Local and Global
Learnability and Automatizability
On the Complexity of Undecidable Problems in Automata Theory
Towards a Theory of Nearly Constant Time Parallel Algorithms
Private Quantum Channels
Markov Chains and Polynomial Time Algorithms
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
The Price of Stability for Network Design with Fair Cost Allocation
The Sign-Rank of AC^O
The Security of Individual RSA Bits
New Limits on Fault-Tolerant Quantum Computation
Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions
On the Cryptographic Hardness of Finding a Nash Equilibrium
The Bit Complexity of Efficient Continuous Optimization
On Alternation (Preliminary Version)
Random CNF's are Hard for the Polynomial Calculus
Interactive Channel Capacity Revisited
An Output Sensitive Algorithm for Computing Visibility Graphs
On Heads Versus Tapes
Bounded Independence Fools Halfspaces
Simplified and Improved Resolution Lower Bounds
On the Optimal Evaluation of a Set of n-Linear Forms
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
Balanced Allocations of Cake
Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2
Fast Allocation Algorithms
Minimizing Movement in Mobile Facility Location Problems
Towards a DNA Sequencing Theory (Learning a String) (Preliminary Version)
The minimal synthesis of tree structures
Linear Pattern Matching Algorithms
The Locality of Distributed Symmetry Breaking
Improved Optimal Testing Results from Global Hypercontractivity
Uniform Memory Hierarchies
Some Related Problems from Network Flows, Game Theory and Integer Programming
Symmetry in Systems of Asynchronous Processes
Approximation through Multicommodity Flow
Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1
Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing
String Adjunct Grammars
The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space
Reconstruction for Models on Random Graphs
Solving Some Graph Problems with Optimal or Near-Optimal Speedup on Mesh-of-Trees Networks
Approximating Maximum Weight Matching in Near-Linear Time
Compressing and Teaching for Low VC-Dimension
Generalized Decomposition of Incomplete Finite Automata
Solving Systems of Set Constraints with Negated Subset Relationships
Solving SDP Faster: A Robust IPM Framework and Efficient Implementation
Polynomial-Time Tensor Decompositions with Sum-of-Squares
Simple Optimal Hitting Sets for Small-Success RL
Chasing the K-Colorability Threshold
Exact Learning of Read-Twice DNF Formulas (Extended Abstract)
Reducibility and Completeness in Multi-Party Private Computations
Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication
Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption
Logspace Versions of the Theorems of Bodlaender and Courcelle
The Isomorphism Conjecture Holds Relative to an Oracle
Finding Monotone Patterns in Sublinear Time
On the Second Eigenvalue of Random Regular Graphs (Preliminary Version)
RSPACE(S) \subseteq DSPACE(S 3/2 )
Fault-tolerant Computation in the Full Information Model (Extended Abstract)
Online Facility Location
The Dynamics of Influence Systems
Rounding Semidefinite Programming Hierarchies via Global Correlation
What Can We Learn Privately?
Satisfiability Coding Lemma
Resource Allocation with Immunity to Limited Process Failure (Preliminary Report)
Linear Level Lasserre Lower Bounds for Certain k-CSPs
Novel Polynomial Basis and Its Application to Reed-Solomon Erasure Codes
25th Annual Symposium on Foundations of Computer Science, West Palm Beach, Florida, USA, 24-26 October 1984
Computing Equilibria in Anonymous Games
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
Load Balancing with Memory
A New Direction for Counting Perfect Matchings
Junta Correlation is Testable
Clustering with Spectral Norm and the k-Means Algorithm
Quantum Multi Prover Interactive Proofs with Communicating Provers
A Characterization of Some Asynchronous State Assignments
The Ellipsoid Algorithm for Linear Inequalities in Exact Arithmetic
Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon
An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem
Multi-resolution Hashing for Fast Pairwise Summations
Klee's Measure Problem Made Easy
3-Coloring in Time O(1.3446 n ): A No-MIS Algorithm
The decision and synthesis problems in semimodular switching theory
Lower Bounds for Quantum Communication Complexity
Parenthesis Generators
A theory of high-speed clocked logic
Triangulation and Embedding Using Small Sets of Beacons
A Method for the Combined Row-Column Reduction of Flow Tables
Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains
The Complexity of Distributed Concurrency Control
Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation
Simulating Quantum Correlations with Finite Communication
Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages
Asynchronous Sequential Switching Circuits with Unrestricted Input Changes
An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n)
Approximating Maximum Independent Set for Rectangles in the Plane
Tight Hardness of the Non-commutative Grothendieck Problem
Almost Optimal Canonical Property Testers for Satisfiability
A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees (Extended Abstract)
Every Polynomial-Time 1-Degree Collapses iff P=PSPACE
Query-optimal estimation of unitary channels in diamond distance
Killing a vortex
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
Deterministic Broadcasting Time in Radio Networks of Unknown Topology
Quantum learning algorithms imply circuit lower bounds
Exponential Separation of Information and Communication
Non-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond
Limited Subsets of a Free Monoid
Computing Planar Intertwines
Optimal Quantile Estimation: Beyond the Comparison Model
Isomorhism of Hypergraphs of Low Rank in Moderately Exponential Time
An Approximate L 1 -Difference Algorithm for Massive Data Streams
New Constructive Aspects of the Lovasz Local Lemma
Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness
Learning Geometric Concepts via Gaussian Surface Area
The Complexity of Facets Resolved
Cryptography from Anonymity
Synthesis of Asynchronous Sequential Circuits with Minimum Number of Delay Elements
Overcoming the Memory Bottleneck in Suffix Tree Construction
The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations
Fast and Lean Self-Stabilizing Asynchronous Protocols
Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration
Tight Hardness Results for LCS and Other Sequence Similarity Measures
A Forward-Backward Single-Source Shortest Paths Algorithm
Differentially Private Release and Learning of Threshold Functions
Fault Diagnosis in a Flash
Algebraic Dependencies (Extended Abstract)
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract)
Efficiently Inverting Bijections Given by Straight Line Programs
Expanders Might Be Practical: Fast Algorithms for Routing Around Faults on Multibutterflies
Power of Fast VLSI Models Is Insensitive to Wires' Thinness
Broadcasting with Side Information
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs
A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis
Satisfiability of Ordering CSPs above Average is Fixed-Parameter Tractable
Nash Equilibria in Random Games
Multiway Online Correlated Selection
Parallel Powering
Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String (Extended Abstract)
The Power of Uniform Sampling for Coresets
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees
Legal Coloring of Graphs
On the total length of an experiment, I
A Weak Version of the Blum, Shub & Smale model
Active Linear Regression for ℓp Norms and Beyond
Randomized Online Graph Coloring (Preliminary Version)
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature
The Complexity of the Hajós Calculus
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation
Lower Bounds on Signatures From Symmetric Primitives
The Multi-Tree Approach to Reliability in Distributed Networks
The Dyck Language Edit Distance Problem in Near-Linear Time
Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract)
An Algebraic Formulation of Knuthian Semantics
Priority Paging Algorithms and the Extension Problem
Succincter
Semi-Bandit Learning for Monotone Stochastic Optimization
An Optimal Algorithm for Intersecting Line Segments in the Plane
A Subexponential Algorithm for Abstract Optimization Problems
Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational Geometry
Exact Analysis of Hot-Potato Routing (Extended Abstract)
Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs
A Distributed Abstract Data Type Implemented by a Probabilistic Communication Scheme
On Small-Depth Frege Proofs for Tseitin for Grids
LR-Regular Grammars-An Extension of LR(k) Grammars
A Dense Model Theorem for the Boolean Slice
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
Zero-Knowledge Sets
Non-malleable Extractors, Two-Source Extractors and Privacy Amplification
On the Capability of Finite Automata in 2 and 3 Dimensional Space
On the Existence of Booster Types
The Tile Assembly Model is Intrinsically Universal
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
Estimating the Multiplicities of Conflicts in Multiple Access Channels (Preliminary Report)
On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract)
Planar Earthmover is not in L_1
Parity, Circuits, and the Polynomial-Time Hierarchy
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
On Randomized Memoryless Algorithms for the Weighted K-Server Problem
Budget Feasible Mechanisms
Possible Futures, Acceptances, Refusals, and Communicating Processes
An Improved Pseudopolynomial Time Algorithm for Subset Sum
On the Optimality of Some Set and Vector Algorithms
A Small PRG for Polynomial Threshold Functions of Gaussians
Factorial Lower Bounds for (Almost) Random Order Streams
A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem
S p 2 subseteq ZPP NP
On the analysis of functional symmetry
Design and Analysis of Dynamic Huffman Coding (Extended Abstract)
2-norm Flow Diffusion in Near-Linear Time
Counting Axioms Do Not Polynomially Simulate Counting Gates
Using Comparison Trees to Derive Lower Bounds for Selection Problems
Ianov Schemas Augmented by a Pushdown Memory
Demonstrating hazards in sequential relay circuits
On Uniquely Represented Data Structures (Extended Abstract)
A Comparative Study of X-Tree, Pyramid and Related Machines
Instance-Optimal Geometric Algorithms
Statistical Indicators of Optimality
From Unprovability to Environmentally Friendly Protocols