yusuke1997/dblp-id-title huggingface dataset:
Hypertext from the Data Point of View: Paths and Links in the Perseus Project
INFOSHARE: A Network-Based Cooperation Tool (Demonstration)
An Interaction Engine for Rich Hypertexts
Coulomb and Electrostatics: A Hypermedia Approach to History of Physics in Education (Demonstration)
MICROCOSM: An Open Model for Hypermedia with Dynamic Linking
Hypermedia for Teaching and Learning: A Multimedia Guide to the History of European Civilization (MuG)
Music in Time-Based Hypermedia
Scenario-Based Hypermedia: A Model and a System
Electronic Lecture Notes (Demonstration)
Under CoVer: The Implementation of a Contextual Version Server for Hypertext Applications
How Should Hypermedia Authoring Systems for Computer Aided Instruction Look Like? (Panel)
Querying Structured Documents with Hypertext Links using OODBMS
ECHT '92: European Conference on Hypertext Technology, November 30 - December 4, 1992, Milan, Italy
Aesthetic and Rhetorical Aspects of Linking Video in Hypermedia
Gram: A Graph Data Model and Query Language
CEC Briefing: Information Engineering and Telematics (Panel)
Hypertext and Information Retrieval: What are the Fundamental Concepts? (Panel)
Interactive Clustering for Navigating in Hypermedia Systems
The Hypermedia Encyclopaedia of Philosophical Sciences (Demonstration)
Light Hypermedia Link Services: A Study of Third Party Application Integration
Extending the Microcosm Model to a Distributed Environment
The Advantages of Hypertext for Large Information Spaces; Where Are the Big Systems? (Panel)
Hypermovie: An Authoring Tool for Video-Disk Based Teaching (Demonstration)
Toward a Rhetoric of Information Texts
Hierarchy, Composition, Scripting Languages, and Translators for Structured Hypertext
Inside Macintosh as Hypertext
A Hypertext for Learning Operational Research (Demonstration)
Chimera: Hypertext for Heterogeneous Software Environments
Linking Considered Harmful
From Infinity to Infinity (a Multimedia History of the Universe, Demonstration)
Musical Instruments of the World (Demonstration)
Building Hypertext on a Multimedia Toolkit: An Overview of Andrew Toolkit Hypermedia Facilities
DARC - Document ARchive Controller (Demonstration)
The Future of Electronic Literacy: Will Hypertext Ever Find Acceptance?
SEPIA: A Cooperative Hypermedia Authoring Environment
SIROG - A Responsive Hypertext Manual
Fishing for Clarity in Hyperdocuments with Enhanced Fisheye-Views
Where's the Hypertext? The Dickens Web as a System-Independent Hypertext
Hyperform: Using Extensibility to Develop Dynamic, Open and Distributed Hypertext Systems
HTML - Poison or Panacea? (Panel)
Hypertext and Electronic Publishing (Panel)
A Logical Query Language for Hypertext Systems
Video Nodes and Video Webs: Uses of Video in Hypermedia
Towards an Integrated Information Environment with Open Hypermedia Systems
Representation and Manipulation of Conceptual, Temporal and Geographical Knowledge in a Museum Hypermedia System
Design Issues for a Dexter-Based Hypermedia System
Cognitive Processing of Hyperdocuments: When Does Nonlinearity Help?
Hypertext: Concepts, Systems and Applications, Proceedings of the European Conference on Hypertext, INRIA, France, November 1990
Intelligent Hypertext for Normative Knowledge in Engineering
Combining Hypertext and Structured Documents in GRIF (Demonstration)
The Document Sampler (Demonstration)
SaTellite: Hypermedia Navigation by Affinity
UNIX Guide: Lessons from Ten Years' Development
The Hypermedia Authoring Environment SEPIA (Demonstration)
SIHEN: Sistema Integrado Hypertestual para ENciclopedia (Demonstration)
Combining Hypertext and Structured Documents in Grif
Hypertext: Beyond the End of the Book
MuG: Multimedia Guide to the History of European Civilization (Demonstration)
KWICK: the Knowledge Worker's Workbench (Demonstration)
Making Use of Hypertext Links when Retrieving Information
An Apprentice That Discovers Hypertext Links
ECHT '94: European Conference on Hypertext Technology, September 19-23, 1994, Edinburgh, Scotland
Videobook (Demonstration)
VIKI: Spatial Hypertext Supporting Emergent Structure
Databases and Competitions: Strategies to Improve Arabic Recognition Systems
Handwritten Character Recognition of Popular South Indian Scripts
Techniques for Solving the Large-Scale Classification Problem in Chinese Handwriting Recognition
A Two-Tier Arabic Offline Handwriting Recognition Based on Conditional Joining Rules
Ensemble Methods to Improve the Performance of an English Handwritten Text Line Recognizer
An Efficient Candidate Set Size Reduction Method for Coarse-Classification in Chinese Handwriting Recognition
Versatile Search of Scanned Arabic Handwriting
Visual Recognition of Arabic Handwriting: Challenges and New Directions
Recent Results of Online Japanese Handwriting Recognition and Its Applications
Handwritten Chinese Character Recognition: Effects of Shape Normalization and Feature Extraction
Multi-lingual Offline Handwriting Recognition Using Hidden Markov Models: A Script-Independent Approach
A Review on Persian Script and Recognition Techniques
Multi-character Field Recognition for Arabic and Chinese Handwriting
Segmentation-Driven Offline Handwritten Chinese and Arabic Script Recognition
Arabic and Chinese Handwriting Recognition - SACH 2006 Summit College Park, MD, USA, September 27-28, 2006 Selected Papers
How to Deal with Uncertainty and Variability: Experience and Solutions
Human Reading Based Strategies for Off-Line Arabic Word Recognition
Growing a Software Language for Hardware Design
A Golden Age of Hardware Description Languages: Applying Programming Language Techniques to Improve Design Productivity
Draining the Swamp: Micro Virtual Machines as Solid Foundation for Language Development
Front Matter, Table of Contents, Preface
Blame Tracking and Type Error Debugging
Leveraging Sequential Computation for Programming Efficient and Reliable Distributed Systems
Search for Program Structure
Verified Compilers for a Multi-Language World
A Few Lessons from the Mezzo Project
Hardware-Software Co-Design: Not Just a Cliché
Toward Semantic Foundations for Program Editors
Title, Table of Contents, Preface, List of Authors
None, One, Many - What's the Difference, Anyhow?
What is a Secure Programming Language?
I Can Parse You: Grammars for Dialogs
Programming Language Abstractions for Modularly Verified Distributed Systems
The Design of Terra: Harnessing the Best Features of High-Level and Low-Level Languages
A Tour of Gallifrey, a Language for Geodistributed Programming
Yedalog: Exploring Knowledge at Scale
Fission: Secure Dynamic Code-Splitting for JavaScript
Linking Types for Multi-Language Software: Have Your Cake and Eat It Too
The Silently Shifting Semicolon
Go Meta! A Case for Generative Programming and DSLs in Performance Critical Systems
The Dynamic Practice and Static Theory of Gradual Typing
The End of History? Using a Proof Assistant to Replace Language Design with Library Design
Overparameterization: A Connection Between Software 1.0 and Software 2.0
Everything You Want to Know About Pointer-Based Checking
A Complement to Blame
Natural Language is a Programming Language: Applying Natural Language Processing to Software Development
Programming Language Tools and Techniques for 3D Printing
Domain-Specific Symbolic Compilation
A Theory AB Toolbox
Intermittent Computing: Challenges and Opportunities
Taming the Static Analysis Beast
3rd Summit on Advances in Programming Languages, SNAPL 2019, Providence, RI, USA, May 16-17, 2019
From Macros to DSLs: The Evolution of Racket
New Directions for Network Verification
Version Control Is for Your Data Too
Let's Fix OpenGL
Tracking the Flow of Ideas through the Programming Languages Literature
Refined Criteria for Gradual Typing
Coupling Memory and Computation for Locality Management
Everest: Towards a Verified, Drop-in Replacement of HTTPS
Programming with "Big Code": Lessons, Techniques and Applications
The Need for Language Support for Fault-Tolerant Distributed Systems
The Next 700 Semantics: A Research Challenge
Toward a Dependability Case Language and Workflow for a Radiation Therapy System
2nd Summit on Advances in Programming Languages, SNAPL 2017, Asilomar, CA, USA, May 7-10, 2017
AP: Artificial Programming
Migratory Typing: Ten Years Later
1st Summit on Advances in Programming Languages, SNAPL 2015, Asilomar, California, USA, May 3-6, 2015
InterPoll: Crowd-Sourced Internet Polls
Bridging the Gap Between General-Purpose and Domain-Specific Compilers with Synthesis
Formal Verification vs. Quantum Uncertainty
Uncanny Valleys in Declarative Language Design
Toward Domain-Specific Solvers for Distributed Consistency
Certifying and Reasoning on Cost Annotations of Functional Programs
Reasoning About Resources in the Embedded Systems Language Hume
Derivational Complexity Is an Invariant Cost Model
Collected Size Semantics for Strict Functional Programs over General Polymorphic Lists
Comparing Cost Functions in Resource Analysis
Non-deterministic Boolean Proof Nets
Certified Complexity (CerCo)
Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion?
On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets
Foundational and Practical Aspects of Resource Analysis - Third International Workshop, FOPARA 2013, Bertinoro, Italy, August 29-31, 2013, Revised Selected Papers
Counter Automata for Parameterised Timing Analysis of Box-Based Systems
Improvements to a Resource Analysis for Hume
Interpolation-Based Height Analysis for Improving a Recurrence Solver
Global and Local Space Properties of Stream Programs
Using Dependent Types to Define Energy Augmented Semantics of Programs
Certifying Execution Time
On Abstractions for Timing Analysis in the $\mathbb{K}$ Framework
Characterising Effective Resource Analyses for Parallel and Distributed Coordination
A Local Criterion for Polynomial-Time Stratified Computations
Foundational and Practical Aspects of Resource Analysis - Second International Workshop, FOPARA 2011, Madrid, Spain, May 19, 2011, Revised Selected Papers
May-Happen-in-Parallel Analysis with Condition Synchronization
Static Complexity Analysis of Higher Order Programs
Polynomial Time Computation in the Context of Recursive Analysis
Foundational and Practical Aspects of Resource Analysis - First International Workshop, FOPARA 2009, Eindhoven, The Netherlands, November 6, 2009, Revised Selected Papers
A Space Consumption Analysis by Abstract Interpretation
Typing a Core Binary-Field Arithmetic in a Light Logic
Inferring Parametric Energy Consumption Functions at Different Software Levels: ISA vs. LLVM IR
Foundational and Practical Aspects of Resource Analysis - 4th International Workshop, FOPARA 2015, London, UK, April 11, 2015, Revised Selected Papers
Probabilistic Resource Analysis by Program Transformation
Timing Properties and Correctness for Structured Parallel Programs on x86-64 Multicores
On the Modular Integration of Abstract Semantics for WCET Analysis
A Hoare Logic for Energy Consumption Analysis
Call-by-Value, Elementary Time and Intersection Types
A Higher-Order Characterization of Probabilistic Polynomial Time
Predicative Lexicographic Path Orders - An Application of Term Rewriting to the Region of Primitive Recursive Functions
Interval-Based Resource Usage Verification: Formalization and Prototype
Probabilistic Analysis of Programs: A Weak Limit Approach
Recursive Backdoors for SAT
A Foundation of Programming a Multi-tape Quantum Turing Machine
Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes
On Unification of QBF Resolution-Based Calculi
Flow Logic for Imperative Objects
Regularity of Congruential Graphs
Embedding of Hypercubes into Grids
Schema Evolution for XML: A Consistency-Preserving Approach
One-Dimensional Guarded Fragments
Ordinal Measures of the Set of Finite Multisets
Communication Complexity and Sequential Compuation
On Behaviour of R-Fuzzy Automata
Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings
Parsing Strategies: A Concise Survey (Preliminary Report)
Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks
Some Improved Parallelisms for Graphs
Validity Test for Floyd's Operator-Precedence Parsing Algorithms
Integrating the Specification Techniques of Graph Transformation and Temporal Logic
Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity
Existence of Secure Equilibrium in Multi-player Games with Perfect Information
On Cardinal Sequential Outer Measures
Pattern Matching in Order-Sorted Languages
On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs
Strategy Machines and Their Complexity
The Power Word Problem
An Efficient Decision Algorithm for the Uniform Semi-Unification Problem
Relations between Programs with Different Storage Requirements
Minimizing Cost Register Automata over a Field
Valiant's Model: From Exponential Sums to Exponential Products
Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings
Hybrid Parallel Programming and Implementation of Synchronised Communication
The Joys of Bisimulation
Strong Conjunction and Intersection Types
Optimization, Games, and Quantified Constraint Satisfaction
Graph Similarity Based on Matrix Norms
Syntax and Semantics of a Monotonic Framework for Non-Monotonic Reasoning
On Hadamard Series and Rotating Q-Automata
Competitive Packet Routing with Priority Lists
Rent or Buy Problems with a Fixed Time Horizon
On Stochastic Games with Multiple Objectives
Enumeration of the Monomials of a Polynomial and Related Complexity Classes
On the Relativization of Deterministic and Nondeterministic Complexity Classes
Axioms of Algorithmic Logic Univocally Determine Semantics of Programs
Polynomial Kernels for Weighted Problems
Canonical Disjoint NP-Pairs of Propositional Proof Systems
Register Transducers Are Marble Transducers
Obtaining Planarity by Contracting Few Edges
Descriptional Complexity of Context-Free Languages
Eulerian Paths with Regular Constraints
Reusable Specification Components
Dynamic Matchings in Convex Bipartite Graphs
On the Complexity of Master Problems
Iterative Arrays with Small Time Bounds
Dots & Boxes Is PSPACE-Complete
Partial Solution and Entropy
An Algorithmic Meta Theorem for Homomorphism Indistinguishability
Recursivity, Sequence Recursivity, Stack Recursivity and Semantics of Programs
Image Compression Using Weighted Finite Automata
Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs
Fuzzy Simultaneous Congruences
All Superlinear Inverse Schemes Are coNP-Hard
Small-Space LCE Data Structure with Constant-Time Queries
Online Single Machine Batch Scheduling
A Note on the Automatic Generation of Inductive Assertions
Leakage-Resilient Hardness Equivalence to Logspace Derandomization
The Complexity of Disjunctive Linear Diophantine Constraints
Counting Problems for Parikh Images
Efficient Constructions of Test Sets for Regular and Context-Free Languages
Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings
Generating Paths and Cuts in Multi-pole (Di)graphs
A Lambda Calculus of Incomplete Objects
Minimum Planar Multi-sink Cuts with Connectivity Priors
Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II
Finite Branching Automata: Automata Theory Motivated by Problem Solving
Parameterized Complexity Classes under Logical Reductions
Polynomial Automaticity, Context-Free Languages, and Fixed Points of Morphism (Extended Abstract)
On the Faithfulness of Formal Models
Linear Temporal Logic and Finite Semigroups
Covering and Partitioning of Split, Chain and Cographs with Isometric Paths
R-Fuzzy Grammars
Uncertain Curve Simplification
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
Pebble Transducers with Unary Output
A Complete Inference System for an Algebra or Regular Acceptance Models
Nondeterministic Graph Searching: From Pathwidth to Treewidth
The Complexity of the Falsifiability Problem for Pure Implicational Formulas
Parameterized Vertex Integrity Revisited
Energy and Mean-Payoff Parity Markov Decision Processes
Phase Transition for Local Search on Planted SAT
Parallel Arithmetic Computations: A Survey
Two Lower Bounds on Distributive Generation of Languages
An Algebra for Parallelism Based on Petri Nets
A Note on Computational Complexity of a Statistical Deducibility Testing Procedure
Smart Robot Teams Exploring Sparse Trees
Reasoning About the Past
On the Complexity of the Conditional Independence Implication Problem with Bounded Cardinalities
On the Power of Communication in Alternating Machines
A Lower Bound of 1+ phi for Truthful Scheduling Mechanisms
The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems
New Results for Non-Preemptive Speed Scaling
Optimal Sorting of Seven Element Sets
Relative Randomness and Continuous Translation Functions
A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic
The Complexity of (P₃, H)-Arrowing and Beyond
Lagrange's Theorem for Binary Squares
Strong Keys for Tensor Isomorphism Cryptography
Dividing by Zero - How Bad Is It, Really?
Does Treewidth Help in Modal Satisfiability? - (Extended Abstract)
Concurrent Automata vs. Asynchronous Systems
Some Open Problems in Computational Geometry (Invited Talk)
An Approach to Correctness Proofs of Semicoroutines
Model Checking Coverability Graphs of Vector Addition Systems
Random Boolean Formulas Representing any Boolean Function with Asymptotically Equal Probability (Extended Abstract)
Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model
Blockwise Variable Orderings for Shared BDDs
Complexity Measures Defined by Mazurkiewicz-Algorithms
On the Upward/Downward Closures of Petri Nets
Decision Problems for Cellular Automata and Their Semigroups
Proving Program Properties, Symbolic Evaluation and Logical Procedural Semantics
Unreliable Colonies as Systems of Stochastic Grammars
Interactive L Systems with Almost Interactionless Behaviour
Generalized Budgeted Submodular Set Function Maximization
LCF: A Way of Doing Proofs with a Machine
The Steiner Tree Problem and Homogeneous Sets
Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set
Broadcasting Under Structural Restrictions
Substitution and (Semi-)AFL
A Truely Morphic Characterization of Recursively Enumerable Sets
The Complexity of Graph Connectivity
Computational Complexity in the Hyperbolic Plane
On Computational Power of Weighted Finite Automata
Code Problems on Traces
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
On Approximating the Number of Bases of Exchange Preserving Matroids
Algebraic Barriers to Halving Algorithmic Information Quantities in Correlated Strings
Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract)
Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract)
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
Free Petri Net Languages
Mesh Deformation of Dynamic Smooth Manifolds with Surface Correspondences
Many-Sorted Temporal Logic for Multi-Processes Systems
On the Periods of Partial Words
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
Classifying Recognizable Infinitary Trace Languages Using Word Automata
on the Largest Full Sub-AFL of the Full AFL of Context-Free Languages
Captive Cellular Automata
Best Fit Bin Packing with Random Order Revisited
On FO2 Quantifier Alternation over Words
New Hardness Results for Low-Rank Matrix Completion
Parameterized Approximation Scheme for Feedback Vertex Set
On Fourier Analysis of Sparse Boolean Functions over Certain Abelian Groups
The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes
From Specification Languages to Specification Knowledge Bases: The PTO Approach
On Graph Queries and Modal Constraints (Invited Talk)
Integer Factoring Using Small Algebraic Dependencies
On the Complexity Landscape of Connected f-Factor Problems
Converting Two-Way Nondeterministic Unary Automata into Simpler Automata
Countdown μ-Calculus
Hausdorff Reductions to Sparse Sets and to Sets of High Information Content
SAT-Based Circuit Local Improvement
How to Reconstruct a Genome
On the Relative Power of Linear Algebraic Approximations of Graph Isomorphism
Strongly Connected G-S-M Mappings Preserving Conjugation
Optimal Preemptive Scheduling for General Target Functions
Solving Polynomial Fixed Point Equations
The Maximum k-Flow in a Network
Affine Consistency and the Complexity of Semilinear Constraints
Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques
Matroid Intersections, Polymatroid Inequalities, and Related Problems
Variable Substitution with Iconic Combinators
On the Power of Uniform Families of Constant Depth Treshold Circuits
Conniver Programs by Logical Point of View
The Robust Set Problem: Parameterized Complexity and Approximation
An Investigation of Controls for Concurrent Systems by Abstract Control Languages
A Tile-Based Coordination View of Asynchronous pi-Calculus
On the Composition Problem for OBDDs with Multiple Variable Orders
A New Characterization of FAC⁰ via Discrete Ordinary Differential Equations
Multiparty Communication Complexity: Very Hard Functions
Mathematical Model of Programs with Dynamic Allocation of Variables
Online Interval Coloring with Packing Constraints
NOF-Multiparty Information Complexity Bounds for Pointer Jumping
Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract)
Fully Effective Solutions of Recursive Domain Equations
Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient
On Some Recognizable Picture-Languages
Finding Patterns in Given Intervals
Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings
Dobrushin Conditions for Systematic Scan with Block Dynamics
On Complexity of Confluence and Church-Rosser Proofs
A Recursion-Theoretic Characterization of the Probabilistic Class PP
Systolic Arrays: Characterizations and Complexity
The Completeness of Propositional Dynamic Logic
Modern Parallel Algorithms (Invited Talk)
The Space Complexity of the Accessibility Problem for Undirected Graphs of Log N Bounded Genus
On Ianov Schemas with One Memory Location
An Extended Herbrand Theorem for First-Order Theories with Equality Interpreted in Partial Algebras
Characterization of Sensitive Linear Cellular Automata with Respect to the Counting Distance
Exact and Approximation Algorithms for Routing a Convoy Through a Graph
Quantum Testers for Hidden Group Properties
Demonic Variance and a Non-Determinism Score for Markov Decision Processes
Parallel Alternating-Direction Access Machine
Interrogative Complexity of omega-Languages' Recognition
On Efficiency of Interval Routing Algorithms
Towards a Galois Theory of Algorithmic Problems
Logical Characterizations of Nonmonotonic TMSs
Some Fundamentals of Order-Algebraic Semantics
Domination Above r-Independence: Does Sparseness Help?
Towards a Semantic Theory of CML (Extended Abstract)
Faster Lightweight Lempel-Ziv Parsing
On the Connectivity of the Periodic Sum of Automata
Heterogeneous Unified Algebras
On the Length of the Minimum Solution of Word Equations in One Variable
On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant
Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs
On Guidable Index of Tree Automata
RNA-Folding - From Hardness to Algorithms
Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs
pi-Calculus, Structured Coalgebras, and Minimal HD-Automata