yusuke1997/dblp-id-title huggingface dataset:
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract)
Optimal Coding and Sampling of Triangulations
A Variant of the Arrow Distributed Directory with Low Average Complexity
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
Fitting Tree Metrics and Ultrametrics in Data Streams
An Infinite Hierarchy of Term Languages - An Approach to Mathematical Complexity
Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract)
Restricted CSPs and F-Free Digraph Algorithmics
Zero-Fixing Extractors for Sub-Logarithmic Entropy
On the Expressive Power of Monadic Least Fixed Point Logic
Approximating Observables Is as Hard as Counting
Formalizing and Reasoning about Quality
The Equivalence Problem of Finite Substitutions on ab * c, with Applications
Les types et les appels de procédures
Distributed Private Heavy Hitters
On Observing Nondeterminism and Concurrency
A Faster Interior-Point Method for Sum-Of-Squares Optimization
On the Relationship of CCS and Petri Nets
A PSPACE Complete Problem Related to a Pebble Game
On the Size and the Approximability of Minimum Temporally Connected Subgraphs
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
On the Power of Self-Application and Higher Type-Recursion
Randomized Communication vs. Partition Number
Optimal Logarithmic Time Randomized Suffix Tree Construction
The Linear Voting Model
Shortest Paths Without a Map
Cut Sparsification and Succinct Representation of Submodular Hypergraphs
Regular Expressions for Tree-Width 2 Graphs
Testing Fourier Dimensionality and Sparsity
Algebras, Automata and Logic for Languages of Labeled Birooted Trees
Symmetries and Complexity (Invited Talk)
Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree
Computing the Visibility Polygon of an Island in a Polygonal Domain
The Randomized Coloring Procedure with Symmetry-Breaking
Stable Marriage with Incomplete Lists and Ties
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
Query Efficient Weighted Stochastic Matching
Robust Communication-Optimal Distributed Clustering Algorithms
On Incremental Approximate Shortest Paths in Directed Graphs
Distance Oracles for Vertex-Labeled Graphs
The Product of Rational Languages
Computing the Girth of a Planar Graph
Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks
Sorting and Selection with Imprecise Comparisons
The Expressive Power of Unique Total Stable Model Semantics
Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting
Nominal Kleene Coalgebra
Static Correctness of Hierarchical Procedures
Average Case Complexity
Optimal Non-Adaptive Cell Probe Dictionaries and Hashing
Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
Compositional Closure for Bayes Risk in Probabilistic Noninterference
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals
Generic and Polymorphic Graph Transformations-Supporting the Definition of Visual Languages
On the Complexity of LtlModel-Checking of Recursive State Machines
Password Mistyping in Two-Factor-Authenticated Key Exchange
Ring Signatures of Sub-linear Size Without Random Oracles
A Finite Presentation of Graphs of Treewidth at Most Three
Periodic and Non-periodic Min-Max Equations
From Security Protocols to Pushdown Automata
New Upper Bounds to the Limitedness of Distance Automata
Distributed Arboricity-Dependent Graph Coloring via All-to-All Communication
Space-Time Tradeoffs for Oblivious Interger Multiplications
CRAM: Compressed Random Access Memory
Stable Marriages with Multiple Partners: Efficient Search for an Optimal Solution
Commutative Locative Quantifiers for Multiplicative Linear Logic
Local Reductions
Distributive Online Channel Assignment for Hexagonal Cellular Networks with Constraints
Subspace-Invariant AC^0 Formulas
Direct Sum and Partitionability Testing over General Groups
Boundedness of Monadic FO over Acyclic Structures
A Propos d'une Conjecture de F. Dejean sur les Répétitions dans les Mots
Space-Efficient Scheduling of Stochastically Generated Tasks
Piecewise Boolean Algebras and Their Domains
How Hard Is It to Satisfy (Almost) All Roommates?
Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2
A Linear Time Algorithm to Solve the Single Function Coarsest Partition Problem
Unbalanced Random Matching Markets with Partial Preferences
Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II
Parallel Dictionaries in 2-3 Trees
Two-Way Alternating Automata and Finite Models
Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima
Multiple Random Walks and Interacting Particle Systems
Checking Refinement of Asynchronous Programs Against Context-Free Specifications
Probability and Plurality for Aggregations of Learning Machines
New Developments in Structural Complexity Theory
Clustering under Perturbation Resilience
Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time
Communicating Hierarchical State Machines
Placing Resources in a Tree: Dynamic and Static Algorithms
The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract)
Proceedings of the First Workshop on Membrane Computing and Biologically Inspired Process Calculi, MeCBIC@ICALP 2006, Venice, Italy, July 9, 2006
Automatizability and Simple Stochastic Games
A Characterization of Complexity in Public Goods Games
Testing C_k-Freeness in Bounded Admissibility Graphs
Baire Category Quantifier in Monadic Second Order Logic
Lower Bounds for Sums of Powers of Low Degree Univariates
Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability
Minimum Cost Nowhere-Zero Flows and Cut-Balanced Orientations
Independent Sets in Asteroidal Triple-Free Graphs
Low-Degree Polynomials Extract From Local Sources
The Structure of Trees in the Pushdown Hierarchy
Time-Expanded Packings
Pebbling Moutain Ranges and its Application of DCFL-Recognition
Assigning Papers to Referees
Model Checking with Multi-valued Logics
Scheduling Search Procedures
On Model-Based RIP-1 Matrices
Nondeterministic Streaming String Transducers
Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays
A Faster Algorithm for Minimum Cycle Basis of Graphs
A Sound and Complete Hoare Axiomatization of the Ada-Rendevous
Universal Inherence of Cycle-Free Context-Free Ambiguity Functions
The Group Access Bounds for Binary Search Trees
A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages
Parametric Temporal Logic for "Model Measuring"
Min Cut is NP-Complete for Edge Weigthed Trees
Testing Non-uniform k -Wise Independent Distributions over Product Spaces
52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, Aarhus, Denmark, July 8-11, 2025
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid
Learning Halfspaces with Malicious Noise
The Myriad Virtues of Wavelet Trees
Repetitions in Homomorphisms and Languages
Matching Augmentation via Simultaneous Contractions
Proportional Approval Voting, Harmonic k-median, and Negative Association
Scaled Dimension and Nonuniform Complexity
The Parameterized Complexity of k-Edge Induced Subgraphs
Test Sets for Morphisms with Bounded Delay
Improved Reconstruction of Random Geometric Graphs
Efficient Algorithms on Context-Free Graph Grammars
Conservative Ambiguity Detection in Context-Free Grammars
Games for Dependent Types
Efficient Minimization of Numerical Summation Errors
Group Fairness: Multiwinner Voting and Beyond (Invited Talk)
Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing
Logical and Computational Aspects of Programming with Sets/Bags/Lists
How to Send a Real Number Using a Single Bit (And Some Shared Randomness)
Foundations for Circular Compositional Reasoning
Breaking the 2ⁿ Barrier for 5-Coloring and 6-Coloring
The Genomics Revolution and Its Challenges for Algorithmic Research
An Operational Semantics for Pure Dataflow
Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies
Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (Extended Abstract)
Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up
Polynomial Vector Addition Systems With States
Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms
Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions
Impossibility of a Quantum Speed-Up with a Faulty Oracle
(Delta+1) Coloring in the Congested Clique Model
Scheduling Bidirectional Traffic on a Path
A Lower Bound on Entanglement-Assisted Quantum Communication Complexity
Aperiodic Points in Z 2 -subshifts
On the Density of Color-Families
Causality for Mobile Processes
Easily Refutable Subformulas of Large Random 3CNF Formulas
Streaming Maximal Matching with Bounded Deletions
Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings
Local Approximations of the Independent Set Polynomial
An Approximation Algorithm for Binary Searching in Trees
Invisible Safety of Distributed Protocols
Bohm's theorem: applications to Computer Science Theory, BOTH 2001, Satellite Workshop of ICALP 2001, Crete, Greece, July 13, 2001
Specification-Oriented Semantics for Communicating Processes
Generalised Flowcharts and Games
Label-Guided Graph Exploration by a Finite Automaton
Bipolar Synchronization Systems
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing
Operational Semantics of OBJ-3 (Extended Abstract)
Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not
Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems
Interactive Communication with Unknown Noise Rate
Optimal Cryptographic Hardness of Learning Monotone Functions
The Complexity of Constructing Evolutionary Trees Using Experiments
On the Limits of Sparsification
Balancing Order and Chaos in Image Generation (Extended Abstract)
All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs
Provable Computable Functions on Abstract Data Types
Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings
Revisiting Frequency Moment Estimation in Random Order Streams
A Termination Detector for Static and Dynamic Distributed Systems with Asynchronous Non-first-in-first-out Communication (Extended Abstract)
Impossibility of Sketching of the 3D Transportation Metric with Quadratic Cost
Dynamic Parameterized Problems and Algorithms
A Tighter Insertion-Based Approximation of the Crossing Number
Testing Equivalence for Processes
Infinite-State High-Level MSCs: Model-Checking and Realizability
The Polyranking Principle
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem
Lower Bounds for Multiplication via Network Coding
Efficient Automatic Simulation of Parallel Computation on Network of Workstations
Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
On the Semantics of Markov Automata
Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs
One-Way Communication Complexity of Partial XOR Functions
Locality in Modular Systems
From Nondeterministic to Multi-Head Deterministic Finite-State Transducers
Tight Bounds for Cost-Sharing in Weighted Congestion Games
Deterministic Time-Space Trade-Offs for k-SUM
A Machine-Independent Characterization of Timed Languages
Algorithms and Complexity for Turaev-Viro Invariants
De-amortizing Binary Search Trees
The Variance-Penalized Stochastic Shortest Path Problem
Proving the Herman-Protocol Conjecture
A New Duality Result Concerning Voronoi Diagrams
Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima
The Modal Logic of Programs
Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem
Improved Lower Bounds on the Randomized Complexity of Graph Properties
From Holant to Quantum Entanglement and Back
On the Difference Between One and Many (Preliminary Version)
Smoothed Analysis of Deterministic Discounted and Mean-Payoff Games
On Berge Multiplication for Monotone Boolean Dualization
On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions
Erratum: Bulk-synchronous Parallel Multiplication of Boolean Matrices
Algorithmic Aspects of Semistability of Quiver Representations
External Sampling
Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
Function Evaluation Via Linear Programming in the Priced Information Model
Graph Representation and Computation Rules for Typeless Recursive Languages
The Complexity of Synthesis from Probabilistic Components
Context Unification is in PSPACE
Restricted Branching Programs with Parity-Type Augmentations-Lower Bounds and Algorithms
An Exponential Separation Between MA and AM Proofs of Proximity
A Fully Abstract Encoding of the pi -Calculus with Data Terms
A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal Object
Every Commutative Quasirational Language is Regular
High-Accuracy Multicommodity Flows via Iterative Refinement
Automata, Languages and Programming, 9th Colloquium, Aarhus, Denmark, July 12-16, 1982, Proceedings
LF Successor: Compact Space Indexing for Order-Isomorphic Pattern Matching
On Word Problems in Equational Theories
Decidability and Complexity Results for Timed Automata via Channel Machines
Counting Arbitrary Subgraphs in Data Streams
Tolerant Bipartiteness Testing in Dense Graphs
Data Flow Analysis of Applicative Programs
k-Leaf Powers Cannot Be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5
50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, Paderborn, Germany, July 10-14, 2023
New Algorithms for Learning in Presence of Errors
Computing on Structures
Optimal Cover Time for a Graph-Based Coupon Collector Process
Recursion Schemes and Generalized Interpretations (Extended Abstract)
Jamming-Resistant Learning in Wireless Networks
On Problems without Polynomial Kernels (Extended Abstract)
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling
Sur les monoïdes syntactiques des langages algébriques déterministes
New Approximation Algorithms for (1, 2)-TSP
Dynamic Averaging Load Balancing on Cycles
A Complete Compositional Model Proof System for a Subset of CCS
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
On Eliminating Unit Productions from LR(k) Parsers
Logic Programming with Ions
Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels
Explicit and Efficient Construction of Nearly Optimal Rate Codes for the Binary Deletion Channel and the Poisson Repeat Channel
Oracle Separation of QMA and QCMA with Bounded Adaptivity
On the Concentration of the Height of Binary Search Trees
Sensing Versus Nonsensing Automata
Tight FPT Approximations for k-Median and k-Means
Homogeneity and Homogenizability: Hard Problems for the Logic SNP
Post Correspondence Problem: Words Possible as Primitive Solutions
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion
Demand-Independent Optimal Tolls
On Quasipolynomial Multicut-Mimicking Networks and Kernelization of Multiway Cut Problems
Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems Under ETH
On the Axiomatizability of Priority
On omega-sets Associated with Context-Free Languages
Regularity for a Large Class of Context-Free Processes is Decidable
Cobham's Ttheorem seen through Büchi's Theorem
Fixpoints for Rabin Tree Automata Make Complementation Easy
Competitive Vertex Recoloring
From Sequential Specifications to Eventual Consistency
A Note on Karr's Algorithm
Nonuniform Deterministic Finite Automata over Finite Algebraic Structures
Streaming Submodular Maximization Under Matroid Constraints
Reachability in Bidirected Pushdown VASS
Circuit Extraction for ZX-Diagrams Can Be #P-Hard
Caching Connections in Matchings
Causal Graph Dynamics
Additive Approximation for Edge-Deletion Problems (Abstract)
Optimal Transformations of Games and Automata Using Muller Conditions
Improved Lower Bounds for Reachability in Vector Addition Systems
On the Theory of Interconnection Networks for Parallel Computers
Newton's Method for omega-Continuous Semirings
Universal Factor Graphs
Competition-Induced Preferential Attachment
An Asynchronous Calculus for Generative-Reactive Probalistic Systems
An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction
Universal Succinct Representations of Trees?
Approximation Algorithms for Computing Maximin Share Allocations
Axiomatic Criteria for Quotients and Subobjects for Higher-Order Data Types
Game Semantics for Call-by-Value Polymorphism
Efficient Approximation Algorithms for the Subset-Sums Equality Problem
Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas
The Importance of the Left Merge Operator in Process Algebras
Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N
Polynomial Delay Algorithm for Minimal Chordal Completions
From Proof Complexity to Circuit Complexity via Interactive Protocols
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
A Formal Semantics for Concurrent Systems
Total Colorings of Degenerated Graphs
Characterization of Binary Constraint System Games
ATL* Satisfiability Is 2EXPTIME-Complete
Amalgamation in CASL via Enriched Signatures
The Complexity of Proving That a Graph Is Ramsey
Testing C_k-Freeness in Bounded-Arboricity Graphs
A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity
Partition Bound Is Quadratically Tight for Product Distributions
Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution
Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial
Multiple Source Dual Fault Tolerant BFS Trees
Towards a Predictive Computational Complexity Theory
Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle
Optimal Orthogonal Graph Drawing with Convex Bend Costs
Improved Hardness Results for the Guided Local Hamiltonian Problem
Quantum and Stochastic Branching Programs of Bounded Width
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems
Isomorphism of Regular Trees and Words
A Lower Bound for the Complexity of the Union-Split-Find Problem
Orientability of Random Hypergraphs and the Power of Multiple Choices
Anycasting in Adversarial Systems: Routing and Admission Control
Conjunctive Types and Useless-code Elimination
Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP
On the Shannon Function for Partially Defined Boolean Functions
A Minimal System of Disjunctive Properties for Strictness Analysis
The Bridge Between Regular Cost Functions and Omega-Regular Languages
Online Mechanism Design (Randomized Rounding on the Fly)
Comparing Functional Paradigms for Exact Real-Number Computation
A Framework for Index Bulk Loading and Dynamization
Quantum Adversary (Upper) Bound
Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction Algorithm
A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables
Complexity of Pseudoknot Prediction in Simple Models
The Complexity of Equivariant Unification
Hardness of Equations over Finite Solvable Groups Under the Exponential Time Hypothesis
A Theory of Spectral CSP Sparsification
Approximating Integer Lattices by Lattices with Cyclic Factor Groups
Fast Detection of Polyhedral Intersections
A Kleene Theorem for Infinite Trace Languages
Automata, Languages and Programming, Fifth Colloquium, Udine, Italy, July 17-21, 1978, Proceedings
Timed Testing of Concurrent Systems
Self-Correcting for Function Fields Transcendental Degree
One-Way Communication Complexity of Minimum Vertex Cover in General Graphs
On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids
Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints
Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree
Jumbo lambda -Calculus
From Computational Learning Theory to Discovery Science
Approximate Problems for Finite Transducers
Automorphisms and Isomorphisms of Maps in Linear Time
Fast Convergence for Consensus in Dynamic Networks
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems
Algebraic Parsing Techniques for Context-Free Languages
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding
On Enumeration Procedures for Theorem Proving and for Integer Programming
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
DOS Systems and Languages
Bounded Fixed-Parameter Tractability and log 2 n Nondeterministic Bits
Separations Between Combinatorial Measures for Transitive Functions
Effective Models of Polymorphism, Subtyping and Recursion (Extended Abstract)
Computation Times of NP Sets of Different Densities
Generalized Framework for Selectors with Applications in Optimal Group Testing
It's Hard to HAC Average Linkage!
Taming Infinity One Chunk at a Time: Concisely Represented Strategies in One-Counter MDPs
Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle?
When Are Timed Automata Determinizable?
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
A Faster Algorithm for Pigeonhole Equal Sums
Provenance Circuits for Trees and Treelike Instances
Containment of Monadic Datalog Programs via Bounded Clique-Width
Simpler and Faster Dictionaries on the AC 0 RAM
Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic
Yet Another Simple Proof of the PCRP Theorem
Computational Coverage of TLG: Nonlinearity
Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings
Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem
Formally Verifying a Compiler: What Does It Mean, Exactly?
On Probabilistic Time and Space
The Tree Inclusion Problem: In Optimal Space and Faster
Structural Iterative Rounding for Generalized k-Median Problems
On Complete Problems for NP$\cap$CoNP
Solving the String Statistics Problem in Time O(n log n)
On Cartesian Trees and Range Minimum Queries
Bayesian Inference in Quantum Programs
Event Based Reasoning - A System for Proving Correct Termination of Programs
Global and Local Invariants in Transition Systems
Left-Fitting Translations
Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation
Distributed Computing on Core-Periphery Networks: Axiom-Based Design
Test Sets for Homomorphism Equivalence on Context Free Languages
On the Complements of Partial k-Trees
When is Containment Decidable for Probabilistic Automata?
List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
Checking Strong/Weak Bisimulation Equivalences and Observation Congruence for the pi-Calculus
Concurrent Constraints in the Fusion Calculus
Functions Equivalent to Integer Multiplication
Finding Optimal Flows Efficiently
Backtracking Games and Inflationary Fixed Points
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination
Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures
Recent Developments in the Theory of Learning (Abstract)