yusuke1997/dblp-id-title huggingface dataset:
ERP Future 2012
Semantic Technologies for Managing Complex Product Information in Enterprise Systems
Sequence of Contracts as a Means of Planning in ERP-Systems
Towards an End-User Development Tool for Mobile ERP Applications
Lean ERP: How ERP Systems and Lean Management Fit Together
Measuring ERP Usability from the Users' Perspective
Positive Impacts of Private Smartphone Experience on Satisfaction with Business Applications: A Counter-Evidence
erp4students: Introducing a Best Practice Example for Vocational Training in Universities
Analysis of the Critical Success Factors for ERP Systems Implementation in U.S. Federal Offices
Are New Configuration Methods 'the Key' to Shorter ERP Implementations?
The Austrian ERP Market: Systems in Use, System Vendors and Implementation Consultancies
Strategic Management in the Branch of Online Accounting Solution Providers
The Future of ERP: A Critical Outlook
Fact-Based Declarative Business Rule Modeling for the Static and Dynamic Perspectives in ERP Applications
Critical Success Factors of e-Learning Scenarios for ERP End-User Training
Innovations in Enterprise Information Systems Management and Engineering - 4th International Conference, ERP Future 2015 - Research, Munich, Germany, November 16-17, 2015, Revised Papers
Customization of On-Demand ERP Software Using SAP Business ByDesign as an Example
How Lean Management Tools are Supported by ERP-Systems: An Overview
Creating Event Logs from Heterogeneous, Unstructured Business Data
ERP Future 2014
Innovation and Future of Enterprise Information Systems, ERP Future 2012 Conference, Salzburg, Austria, November 2012, Revised Papers
Enterprise Resource Planning Requirements Process: The Need for Semantic Verification
Decision Problems for Exponential Rings: The p-adic case
Fundamentals of Computation Theory, 10th International Symposium, FCT '95, Dresden, Germany, August 22-25, 1995, Proceedings
Recursive omega-Languages
The Equivalence Problem for LL- and LR-Regular Grammars
Miscellaneous results on vector addition systems
Parameterized Aspects of Triangle Enumeration
On the Exponentiation of Languages
The Gauß Lattice Basis Reduction Algorithm Succeeds With Any Norm
Probabilistic algorithms in group theory
Expected Behavior of Graph Coloring Algorithms
A Generalization of Dijkstra's Calculus to Typed Program Specifications
How to Search in History
Context-Sensitive Equivalences for Non-interference Based Protocol Analysis
Enumerative combinatorics and algebraic languages
Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2
Reasoning with Fairness Constraints
Functional Systems on Semilattices
An Extended Framework for Default Reasoning
Modeling Operating Systems Schedulers with Multi-Stack-Queue Grammars
On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters
NP-Completeness of st -Orientations for Plane Graphs
On the length of single dynamic tests for monotone Boolean functions
Locally Computable Enumerations
Complexity Gaps of Turing Machines of Infinite Words
Generalized P-Systems
Non-uniform Depth of Polynomial Time and Space Simulations
A Survey of Some Aspects of Computational Learning Theory (Extended Abstract)
Operations on omega-Regular Languages
A New Solution for the Byzantine Generals Problem (Extended Abstract)
Complexity of Minimal Faithful Permutation Degree for Fitting-Free Groups
A Maximum Path Length Pumping Lemma for Edge-Replacement Languages
Muller automata and bi-infinite words
Decidable Weighted Expressions with Presburger Combinators
Average-case Analysis of Equality of Binary Trees Under the BST Probability Model
Bipartite 3-Regular Counting Problems with Mixed Signs
Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel
Kleene's Theorem for Weighted Tree-Automata
Deterministic Preparation of Dicke States
Homomorphisms and Concurrent Term Rewriting
Strictly Deterministic CD-Systems of Restarting Automata
On Properties of Certain Synchronizing Tool for Parallel Computations
Complexity of Approximating Closest Substring Problems
Automatic Kolmogorov Complexity and Normality Revisited
On Difficulties of Solving a Problem of Decomposition of the System of Boolean Equations
Two-States Bilinear Intrinsically Universal Cellular Automata
The Operators minCh and maxCh on the Polynomial Hierarchy
On the Complexities of Linear LL(1) and LR(1) Grammars
Graph Grammars
Reversal-Bounded and Visit-Bounded Realtime Computations
A New Linearizing Restriction in the Pattern Matching Problem
Circuits on Cylinders
Une propriete de la famille GRE
On the Relation Between Firing Sequences and Processes of Petri Nets
Factorization of Fuzzy Automata
The Degrees of Nondeterminism in Pushdown Automata
On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits
Testing Polynomial Equivalence by Scaling Matrices
On an Optimal Quantified Propositional Proof System and a Complete Language for NP cap co-NP
An Efficient Algorithm for the Fast Delivery Problem
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure
Weak Cardinality Theorems for First-Order Logic
Tiling Multi-dimensional Arrays
Rational Cone and Substitution
The Equational Theory of a Boolean Monad
Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract)
Stabbing Segments with Rectilinear Objects
Monte-Carlo Inference and Its Relations to Reliable Frequency Identification
Simultaneous Contact Representations of Planar Graphs
Derandomized Construction of Combinatorial Batch Codes
Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings
Formal Languages Consisting of Primitive Words
Semantic Foundations of Programming
Information-Based Complexity: Recent Results and Open Problems
Determinism and Computational Power of Real Measurement-Based Quantum Computation
A Discrete Approximation and Communication Complexity Approach to the Superposition Problem
Efficient Computation of Singular Moduli with Application in Cryptography
Completeness and Compactness of Quantitative Domains
Linear-Time Minimal Cograph Editing
Possibilities of Probabilistic on-line Counting Machines
Initial Algebraic Semantics for Non Context-Free Languages
On Realization of Boolean Functions by Schemes Consisting of Checked Elements
On the Synthesis of "Irredundant" Automata from a Finite Set of Experiments
r-Domination Problems on Homogeneously Ordered Graphs (Extended Abstract)
Language recognition by linear bounded and copy programs
On Robust Algorithms for the Maximum Weight Stable Set Problem
Trade-Off Results for Connection Management
Categorial Graphs (Extended Abstract)
Semilinearity and Petri nets
Implementation of a UU-Algorithm for Primitive Recursive Tree Functions
On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm (Extended Abstract)
Computational Randomness from Generalized Hardcore Sets
Concentration of multidimensional tape-bounded systems of Turing automata and cellular spaces
On the Category of Event Structures with Dense Time
The Complexity of Computing Maximal Word Functions
Rewriting Regular Inequalities (Extended Abstract)
On the Incompressibility of Monotone DNFs
Fundamentals of Computation Theory, FCT 1979, Proceedings of the Conference on Algebraic, Arthmetic, and Categorial Methods in Computation Theory, Berlin/Wendisch-Rietz, Germany, September 17-21, 1979
Circular Pattern Matching with k Mismatches
Compiler generation and denotational semantics
Space complexity of alternating Turing machines
Improving the Critical Density of the Lagarias-Odlyzko Attack Against Subset Sum Problems
Parallel algorithms for connected components in a graph
On several kinds of space-bounded on-line multicounter automata
Curved Edge Routing
Impossibility Results on Weakly Black-Box Hardness Amplification
Data Structures Maxima
Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy
PRAM's Towards Realistic Parallelism: BRAM's
A Solving of Problems on Technological Models
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization
Dynamic Data Structures with Finite Population: A Combinatorial Analysis
Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings
Computing Role Assignments of Chordal Graphs
One Pebble Does Not Suffice to Search Plane Labyrinths
An Improved Analysis of Goemans and Williamson's LP-Relaxation for MAX SAT
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
Baire's Categories on Small Complexity Classes
Caesar and DNA. Views on Cryptology
Algebras with Approximation and Excursive Data Structures
Adaptive Strategies for Partially Observable Controlled Ranom Series
Spiking Neural P Systems: Some Characterizations
On the Black-Box Complexity of Sperner's Lemma
Expressivity of Time-Varying Graphs
Cellular Automata Universality Revisited
Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages
Correct Translation of Mutually Recursive Function Systems into TOL Collage Grammars
A Kernel Language for Algebraic Specification and Implementation - Extended Abstract
Lower Bounds for Deterministic and Nondeterministic Branching Programs
Classical Simulation Complexity of Quantum Machines
On the Learnability of a Restricted Predicate Formulae
On Distance-d Independent Set Problems for Some Graph Classes
An Algebraic Defenition of Attributed Transformations
An integer-valued metric for patterns
Complexity of Pebble Tree-Walking Automata
Efficient State-Splitting
Computational Complexity of Covering Disconnected Multigraphs
Robust Identification in the Limit from Incomplete Positive Data
The Greedy and Delauney Triangulations are not Bad in the Average Case and Minimum Weight Geometric Triangulation of Multi-Connected Polygons is NP-Complete
Equivalence Problem of Composite Class Diagrams
On Minimizing Regular Expressions Without Kleene Star
Automata in Labyrinths
Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars
On a Connection Between the Resolution Method and the Inverse Method
The Identification of Propositions and types in Martin-Löf's Type Theory: A Programming Example
On Independence Domination
Compositionality of Hennessy-Milner Logic through Structural Operational Semantics
Statistical testing of finite sequences based on algorithmic complexity
On coordinated rewriting
Complexity of Formula Classes in First Order Logic with Functions
New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem
A Complete Set of Axioms for a Theory of Communicating Sequential Processes
Some Properties of Language Families Generated by Commutative Languages
To the Functional Equivalence of Turing Machines
A Note on Broadcasting with Linearly Bounded Transmission Faults in Constant Degree Networks
On Construction of a Complete System of Compression Functions and on Complexity of Monotone Realization of Threshold Boolean Functions
A Parallel Context-Free Derivation Hierarchy
Word problems for groups and contextfree recognition
Polynomial Time Algorithms in the Theory of Linear Diophantine Equations
Adaptive Linear List Reorganization for a System Processing Set Queries
Deciding Top-Down Determinism of Regular Tree Languages
On Space-bounded Synchronized Alternating Turing Machines
On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems
On Word Equations and Makanin's Algorithm
Modular Decompostion of Automata (Survey)
Two-Sided Matching Markets with Strongly Correlated Preferences
Communication as Unification in the Petri Box Calculus
Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof
What One Has to Know When Attacking P vs. NP (Extended Abstract)
Listing All Fixed-Length Simple Cycles in Sparse Graphs in Optimal Time
On formal languages, probabilities, paging and decoding algorithms
On the Number of Keys in Relational Databases
Vector Sequence Analysis and Full Weak Safety for Concurrent Systems
A Self-dependency Constraint in the Simply Typed Lambda Calculus
Information Flow and Width of Branching Programs (Extended Abstract)
On Time-Constructible Functions in One-Dimensional Cellular Automata
Structure Synthesis of Parallel Programs (Methodology and Tools)
Scheduling to Minimize Max Flow Time: Offline and Online Algorithms
Degrees of Circuit Complexity
The Possible Winner Problem with Uncertain Weights Revisited
Convergence of Distributions on Paths
Improved Algorithms and Complexity Results for Power Domination in Graphs
Unambiguity and Fewness for Logarithmic Space
Cordial Forests
Computational Calculus and Hardest Languages of Automata with Abstract Storages
Duality of Functions and Data in Algorithms Description
On Computational Power of Quantum Branching Programs
Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems
Strong endomorphisms of automata
On the Expressive Power of Read-Once Determinants
On Partial Recursive Definitions and Programs
A Tradeoff Between Pagenumber and Width of Book Embedding of Graphs
Cyclic Equalizability of Words and Its Application to Card-Based Cryptography
Impugning Randomness, Convincingly
The Complexity of Maximum Matroid-Greedoid Intersection
An Explicit Solution to Post's Problem over the Reals
Context-Free NCE Graph Grammars
Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems
Some Asymptotic Evalutions of Complexity of Information Searching
Codes, Connected With a Fraction Linear Functions Group and Their Decoding
On the Exact & Approximate Complexity of the Strongly Connected Steiner Subgraph Problem on Two Terminals with Demands
On the Equivalence Problem of States for Cellular Automata
Decidability of confluence for ground term rewriting systems
Propositional Dynamic Logic of Flowcharts
From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates
On the Relation Between Graph Grammars and Graph L-Systems
Parameterized Restless Temporal Path
Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming
On Relative Loss Bounds in Generalized Linear Regression
Remarks on Fixed Points of Functors
Non Deterministic Recursive Program Schemes
Parsing Unranked Tree Languages, Folded Once
Approximating Bounded Degree Instances of NP-Hard Problems
On the Average Complexity of the Membership Problem for a Generalized Dyck Language
State and Transition Complexity of Watson-Crick Finite Automata
Universal traps
Functional Sorts in Data Type Specifications: A Geometric Approach to Semantics
Path Coupling Using Stopping Times
Shallow-Rotation Distance via Forest Representations
Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies
Algebraic Semantics of Type Definitions and Structured Variables
The Computational Complexity of Cellular Automata
The k -Anonymity Problem Is Hard
Open Maps Bisimulations for Higher Dimensional Automata Models
A Tight Omega(loglog n)-Bound on the Time for Parallel Ram's to Compute Nondegenerated Boolean Functions
An Improved Approximation Algorithm for Computing Geometric Shortest Paths
Shortest Dominating Set Reconfiguration Under Token Sliding
Subquadratic Non-adaptive Threshold Group Testing
Graph Automorphisms with Maximal Projection Distances
Fast Perfect Phylogeny Haplotype Inference
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
On Generalized Process Logic
Optimal Embedding of a Toroidal Array in a Linear Array
On Saving Energy in Boolean Circuits via Negations
Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract)
Succinct Representations of Finite Groups
On Direct Methods of Realization of Normal Algorithms by Turing Machines
On the Complexity of Approximate Realization of Continuous Functions by Schemes and Formulas in Continuous Bases
On Subwords of Formal Languages
Lower Bounds in On-Line Geometric Searching
The Hierarchy of Codes
Towards Optimal Locality in Mesh-Indexings
Distance-Based Covering Problems for Graphs of Given Cyclomatic Number
Lower bounds on the complexity of 1-time only branching programs
Axiomatising Asynchronous Process Calculi (abstract)
The Complexity of Connectivity Problems on Context-Free Graph Languages (Extended Abstract)
On the Complexity of Kings
Complexity Classes with Complete Problems Between P and NP-C
Criteria to Disprove Context-Freeness of Collage Languages
Properties of Probabilistic Pushdown Automata (Extended Abstract)
On the Conditions of Supplementicity in Functional Systems
Periodic Multisorting Comparator Networks
Maximum Rectilinear Convex Subsets
Concentration of the Collision Estimator
On Tree Pattern Unification Problems
Methodology of Proving a Finite-State Stochastic Representability and Nonrepresentability
Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21-27, 1983
The Number and the Structure of Typical Sperner and K-Non-Separable Families of Subsets of a Finite Set
Theorem Proving in Intermediate and Modal Logics
Marked Systems and Circular Splicing
Dyck 1 -Reductions of Context-free Languages
Functional Behaviour of Nondeterministic Programs
Synchronized Product of Linear Bounded Machines
Formal algebraic equations
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree
On Strong Separations from AC 0 (Extended Abstract)
To Automation of Theorem Sythesis
Environments, Labyrinths and Automata
Expressiveness of Point-to-Point versus Broadcast Communications
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes
Leftist Grammars and the Chomsky Hierarchy
Reducing Algebraic Tree Grammars
On Exact and Approximation Algorithms for Distinguishing Substring Selection
Automata theory and structural parallel programming
Modelling Change with the Aid of Knowledge and Time
Generic Density and Small Span Theorem
Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata
Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree
Complexity and Depth of Formulas Realizing Functions From Closed Classes
Semilinear Real-Time Systolic Trellis Automata
Automata Classes Induced by Post Classes
Some investigations on finite graphs and their applications
Reasoning with Global Assumptions in Arithmetic Modal Logics
Proof Systems for Struvtured Algebraic Specifications: An Overview
Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures
On Equivalences, Metrics, and Polynomial Time
Processes in Petri Nets
Multicasting in Optical Networks
A More Categorical Model of Universal Algebra
Pairs Covered by a Sequence of Sets
The Recursion Theorem, Approximations, and Classifying Index Sets of Recursively Enumerable Sets
Distributed Catenation and Chomsky Hierarchy
Parikh Image of Pushdown Automata
Context-Free Graph Grammars: Separating Vertex Replacement from Hyperedge Replacement
The Frequent Items Problem in Online Streaming under Various Performance Measures
Randomized Distributed Decision (Invited Lecture Abstract)
Quantum First-Order Logics and Quantum Natural Deduction
Enumeration of Minimal Dominating Sets and Variants
On the Boolean closure of NP
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings
Dynamic Algebras of Programs
Fundamentals of Computation Theory, International Conference FCT'89, Szeged, Hungary, August 21-25, 1989, Proceedings
On the Semantics of Atomized Statements - the Parallel-Choice Option (Extended Abstract)
Two NP-Complete Problems Related to Information Retrieval
Communicating Finite State Machines and an Extensible Toolchain for Multiparty Session Types
On Restricted Boolean Circuits
Recognizing of Chomsky classes of formal languages by two-dimensional iterative arrays
Monotonically Labelled Ordered Trees and Multidimensional Binary Trees
How Powerful Are Infinite Time Machines?
Busy Beaver Scores and Alphabet Size
Polynomial Time Machines Equipped with Word Problems over Algebraic Structures as their Acceptance Criteria
Path Algorithms on Regular Graphs
On the Complexity of Problems on Graphs Defined on Groups
On colour critical graphs
Proving Integrality Gaps without Knowing the Linear Program
From Finite Automata toward Hybrid Systems (Extended Abstract)
On functional tree transducers
Approximating Minimum Cocolourings
Kolmogorov Complexity and Hausdorff Dimension
Graph Theoretical Methods for the Design of Parallel Algorithms
Some Observations of NP Complete Sets
Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs
A quadratic regularity test for non-deleting macro S grammars
Verified Exact Real Computation with Nondeterministic Functions and Limits
On Some Operations of Partial Monotone Boolean Function Simplifying
Logspace Optimization Problems and Their Approximability Properties
A Coinductive Calculus for Asynchronous Side-Effecting Processes
Partial ordering derivations for CCS
The Complexity of Membership Problems for Circuits over Sets of Positive Numbers
On Notions of Regularity for Data Languages
Structur Automata
Shrinking Multi-pushdown Automata
A Hierarchy of Deterministic Top-down Tree Transformations
Refinement of Coloured Petri Nets
On A-Completeness for some Classes of Bounded Determitate Functions
One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata
Reconstructing Many Partitions Using Spectral Techniques
Fast Periodic Correction Networks
An Axiomatization of the Theory of Generalized Ultrametric Semilattices of Linear Signals
Red-Blue Unshared Dominators
Tile Transition Systems as Structured Coalgebras
Fast parallel vertex colouring
Complexity of Positive Influence Domination on Partial Grids
Generalized Satisfiability Problems via Operator Assignments
Elements de la theorie algebrique des arbres
Generalized PCP Is Decidable for Marked Morphisms
FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems
A lower bound on the oscillation complexity of context-free languages
Discrete Analogue of the Neumann Method is not Optimal
Subhedge Projection for Stepwise Hedge Automata
Rank of Rational Finitely Generated W-Languages
(Non)-Approximability for the Multi-criteria TSP (1, 2)
Recent Developments in the Design of Asynchronous Circuits
Fundamentals of Computation Theory - 25th International Symposium, FCT 2025, Wrocław, Poland, September 15-17, 2025, Proceedings
The Equivalence of Schemata with some Feedback
Lower Bounds for Problems Defined by Polynomial Inequalities
Recognizable and Regular Languages in a Category
On some "non-uniform" complexity measures
An O(1.787 n )-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
Concurrency in Timed Automata
Closure Operators for Order Structures
Competitive Exploration of Rectilinear Polygons
Some Formal Systems of the Logic Programming
Homogenity and Completeness
A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application
Domino Snake Problems on Groups
Bounds for c-Ideal Hashing
Free cost measures of trees
D-Representing Code Problem Solution
A Characterization of Binary Search Networks
Energy Complexity and Depth of Threshold Circuits
The Longest Haplotype Reconstruction Problem Revisited
On Diagonalization Methods and the Structure of Language Classes
Generalized Linton Algebras
Complexity of the Problem of Approximation of Stochastic Matrix by Rational Elements
Propositional Logics of Programs: New Directions
Henkin-type semantics for program-schemes to turn negative results to positive
The Kolmogorov Complexity of Real Numbers
Analysis of Compact 0-Complete Trees: A New Access Method to Large Databases
Dichotomy Theorem for the Generalized Unique Satisfiability Problem
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails
The oscillation complexity and a hierarchy of context-free languages