yusuke1997/dblp-id-title huggingface dataset:
Application of Artificial Neural Networks for Different Engineering Problems
Trustworthy Virtualization of the ARMv7 Memory Subsystem
Towards Minimally Conscious Cyber-Physical Systems: A Manifesto
Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages
Sample Method for Minimization of OBDDs
Parallel Processing on Alphas Under MATLAB 5
On Infinite Prefix Normal Words
Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract)
Explaining Single Predictions: A Faster Method
Local Certification of Majority Dynamics
On Majority Voting Games in Trees
Coalition Resilient Outcomes in Max k-Cut Games
Massively Parallel Pattern Recognition with Link Failures
Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere
SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25 - December 2, 2000, Proceedings
Improved Algorithms for Online Load Balancing
Domain Engineering: A Software Engineering Discipline in Need of Research
GRaCe: A Relaxed Approach for Graph Query Caching
Source Code Rejuvenation Is Not Refactoring
Planar Straight-Line Drawing in an O(n)×O(n) Grid with Angular Resolution Omega(1/n)
Nivat's Conjecture Holds for Sums of Two Periodic Configurations
Back to the Future - Should SQL Surrender to SPARQL?
Classification, Formalization and Verification of Security Functional Requirements
SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27 - December 4, 1999, Proceedings
Graphs from Search Engine Queries
Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique
Run-Time Checking Multi-threaded Java Programs
A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract)
Learning Through Imitation by Using Formal Verification
On Synthesis of Specifications with Arithmetic
A Stronger Square Conjecture on Binary Words
A Rule Format for Unit Elements
Scanning Phylogenetic Networks Is NP-hard
On Contracting Graphs to Fixed Pattern Graphs
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
Distributed Network Generation Based on Preferential Attachment in ABS
On the Preservation of Properties When Changing Communication Models
On Featured Transition Systems
Behavioral Safety in a Model With Multiple Class Objects
Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs with Applications to Pseudoentropy
Function Based Requirements Engineering and Design -Towards Efficient and Transparent Plant Engineering
Existence Versus Exploitation: The Opacity of Backdoors and Backbones Under a Weak Assumption
A Semantic Peer-to-Peer Overlay for Web Services Discovery
A Methodology for Performance and Scalability Analysis
Morphing Graph Drawings in the Presence of Point Obstacles
Validating Data from Semantic Web Providers
An Improved Transformation between HILL and Metric Conditional Pseudoentropy
Generalized Distance Polymatrix Games
Fast, Error Correcting Parser Combinatiors: A Short Tutorial
Algorithms for Scalable Storage Servers
On Some New Aspects of Networked Multimedia Systems
An Approach to Modelling and Verification of Component Based Systems
Verifying Parameterized taDOM+ Lock Managers
Interprocess Communication in the T4 System
Unilateral Orientation of Mixed Graphs
NONBLOCKER: Parameterized Algorithmics for minimum dominating set
Selfish Routing in Networks
Simple Distributed Spanners in Dense Congest Networks
Mobility in Wireless Networks
Quantum versus Probabilistic One-Way Finite Automata with Counter
Topology Generation for Web Communities Modeling
Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs
Conjunctive Grammars with Restricted Disjunction
On the Specification of Visual Languages: Multisets as First-Class Citizens
Computational Power of Neuroidal Nets
Compression of Concatenated Web Pages Using XBW
Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP
Parameterizing Role Coloring on Forests
On Structural Parameterizations for the 2-Club Problem
Runtime Distributions and Criteria for Restarts
Middleware and Quality of Service
A Formal Specification Framework for Ad Hoc Mobile Communication Networks
Finding and Certifying Loops
Software System Migration to Cloud-Native Architectures for SME-Sized Software Vendors
Protecting Agent from Attack in Grid Computing III
On Pattern Density and Sliding Block Code Behavior for the Besicovitch and Weyl Pseudo-distances
Tree Signatures and Unordered XML Pattern Matching
Balanced Substructures in Bicolored Graphs
Probabilistic Approaches to Motion Planning
Query Processing in Temporal Evidential Databases
Quantum Challenges
A Framework for Mutant Genetic Generation for WS-BPEL
Practical Implementation of a Quantum Backtracking Algorithm
Multivendor Deployment Integration for Future Mobile Networks
Abstract Storage Devices
A Calculus for Language Transformations
Asynchronous Deterministic Rendezvous on the Line
Tempo Adaptation within Interactive Music Instruments in Mobile Phone
Kahn's Fixed-Point Characterization for Linear Dynamic Networks
Parallelizing Self-Organizing Maps
Point-to-Point Shortest Path Algorithms with Preprocessing
The Orchestra of Multiple Model Repositories
Continuous Processing of Preference Queries in Data Streams
Incomplete Transition Complexity of Some Basic Operations
SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings Volume II
Multilanguage Debugger Architecture
Towards Unlocking the Full Potential of Multileaf Collimators
The Complexity of Graph Exploration Games
On Finite Representations of Infinite-State Behaviours
On the Stability of Approximation for Hamiltonian Path Problems
Requirements Specification Iteratively Combined with Reverse
An Automatic Composition Algorithm for Functional Logic Programs
Security of Electronic Money
A Pipeline for Measuring Brand Loyalty Through Social Media Mining
Clustered Level Planarity
Reasoning About Inconsistent Concurrent Systems: A Non-classical Temporal Logic
A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints
Genetic Algoriths-Based Creation of Fuzzy-Rule Bases for the Car Control
A Light-Weight Formalism for the Specification of Reactive Systems
Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs
Computing Longest Common Substring and All Palindromes from Compressed Strings
Upward Point-Set Embeddability
Liquidsoap: A High-Level Programming Language for Multimedia Streaming
Being Caught between a Rock and a Hard Place in an Election - Voter Deterrence by Deletion of Candidates
Comprehensive System for Systematic Case-Driven Software Reuse
Frequency Pushdown Automata
Roman Hitting Set
SimCo - Hybrid Simulator for Testing of Component Based Applications
Development of Safety-Critical Real-Time Systems
Adaptive Incentive-Compatible Sponsored Search Auction
Online Service Management Algorithm for Cellular/WALN Multimedia Networks
Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching
The Reconstruction of Some 3D Convex Polyominoes from Orthogonal Projections
Flow Decompositions in External Memory
Formal Verification Methods for Industrial Hardware Design
Some Notes on the Complexity of Protein Similarity Search under mRNA Structure Constraints
On-Line Maximum-Order Induces Hereditary Subgraph Problems
Fundamentals of Context=Sensitive Rewriting
Two Grammatical Equivalents of Flip-Pushdown Automata
Space-Efficient STR-IC-LCS Computation
Database Semantics in Heterogenous Environment
Sense of Direction in Processor Networks
The Balanced Satisfactory Partition Problem
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
Deciding Structural Liveness of Petri Nets
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
On Stateless Deterministic Restarting Automata
Parameterized Complexity of d-Hitting Set with Quotas
Bounded TSO-to-SC Linearizability Is Decidable
Progress (and Lack Thereof) for Graph Coloring Approximation Problems
The Mobile Agent Technology
Off-Line Recognition of Cursive Handwritten Czech Text
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Towards a Versatile Contract Model to Organize Behavioral Specifications
Algorithms for Triangulated Terrains
The Straight-Line RAC Drawing Problem Is NP-Hard
A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs
The State of the Art in Dynamic Graph Algorithms
The Information Extraction Framework of Document Spanners - A Very Informal Survey
Forcing Monotonicity in Parameterized Verification: From Multisets to Words
Theoretical Aspects of Symbolic Automata
Payment Scheduling in the Interval Debt Model
A Useful Bounded Resource Functional Language
Capabilities of Ultrametric Automata with One, Two, and Three States
An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA
Algorithms that Access the Input via Queries
On the Parameterized Complexity of s-club Cluster Deletion Problems
On the Piecewise Complexity of Words and Periodic Words
Creating Permanent Test Collections of Web Pages for Information Extraction Research
Knowledge Discovery in Alarm Data Analysis
Cryptography from Learning Parity with Noise
Sharing Energy for Optimal Edge Performance
What is Computation: An Epistemic Approach
Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison
Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance
ONN the Use of Neural Networks for Data Privacy
Partition into Triangles on Bounded Degree Graphs
Maintainability of Automatic Acceptance Tests for Web Applications - A Case Study Comparing Two Approaches to Organizing Code of Test Cases
Database Research Issues in a WWW and GRIDs World
Bayesian Root Cause Analysis by Separable Likelihoods
Visibly Pushdown Transducers with Look-Ahead
Securing the Future - An Information Flow Analysis of a Distributed OO Language
SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings
Do People Use Naming Conventions in SQL Programming?
Lower Bounds for Monotone q-Multilinear Boolean Circuits
An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions
Complexity and Exact Algorithms for Multicut
Teacher-Directed Learning with Mixture of Experts for View-Independent Face Recognition
Counting Infinitely by Oritatami Co-transcriptional Folding
True Random Number Generators Secure in a Changing Environment: Improved Security Bounds
Object-Oriented DBMS and Beyond
On the Semantics of Multistage Interconnection Networks
Role-Based Access Control on Graph Databases
Searching Things in Large Sets of Images
Knowledge Compilation with Empowerment
High Availability Support in CORBA Environments
Iterated Hairpin Completions of Non-crossing Words
Post-processing Association Rules: A Network Based Label Propagation Approach
A SUBSET-SUM Characterisation of the A-Hierarchy
A Formal Software Engineering Paradigm: From Domains via Requirements to Software - Formal Specification & Design Calculi
Mortality Problem for 2×2 Integer Matrices
SOFSEM 2016: Theory and Practice of Computer Science - 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016, Proceedings
Solving Conflicts of Agent Knowledge States in Multiagent Systems
Refinement Inference for Sequence Diagrams
Simulation Problems for One-Counter Machines
On the Induced Problem for Fixed-Template CSPs
Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points
Colorful 3-Rainbow Domination
On Range and Edge Capacity in the Congested Clique
The Reconstruction of Convex Polyominoes from Horizontal and Vertical Projections
More Effort Towards Multiagent Knapsack
Minimum Monotone Spanning Trees
A Structured Codesign Approach to Many-Core Architectures for Embedded Systems
CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions
Grammars and a Random Generator for Deterministic Chain Regular Expressions
A Problem Kernelization for Graph Packing
On the Complexity of Color-Avoiding Site and Bond Percolation
Improved Bounds for Range Mode and Range Median Queries
Use of Dependency Microcontexts in Information Retrieval
Parameterized Complexity of Generalizations of Edge Dominating Set
Biomolecular Computing and Programming (Extended Abstract)
Negotiating the Semantic Gap: From Feature Maps to Semantic Landscapes
Supporting Non-functional Requirements in Services Software Development Process: An MDD Approach
RESTGroups for Resilient Web Services
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances
Engineering Software and Software Engineering
A Fast Order-Preserving Matching with q-neighborhood Filtration Using SIMD Instructions
Event-Clock Visibly Pushdown Automata
SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29 - February 2, 2018, Proceedings
ARCID: A New Approach to Deal with Imbalanced Datasets Classification
On the Security and Composability of the One Time Pad
Matching of Images of Non-planar Objects with View Synthesis
A Local Search Algorithm for Branchwidth
Lower Bounds for Linear Decision Trees with Bounded Weights
Features of Neighbors Spaces
Metadata Management on Data Processing in Data Lakes
Action Research in Software Engineering: Metrics' Research Perspective (Invited Talk)
Tier Aspect Model Based on Updatable Views
Vietnamese Punctuation Prediction Using Deep Neural Networks
Reliable Broadcasting Without Collision Detection
On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Suerstring Problem
On the Structural Parameterized Complexity of Defective Coloring
Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs
Recognizing Graph Products and Bundles
Partial Order Semantics of Types of Nets
The Fusion Object-Oriented Method: an Evaluation
User Care Preference-Based Semantic Service Discovery in a Ubiquitous Environment
Inferring Deterministic Regular Expression with Unorder
UML2PROV: Automating Provenance Capture in Software Engineering
Finding Disjoint Paths in Split Graphs
A Dialogue-Based NLIDB System in a Schedule Management Domain
Trusted Computing - Special Aspects and Challenges
Constraint Logic Programming with Fuzzy Sets
Orienteering (with Time Windows) on Restricted Graph Classes
Core Stability in Hedonic Coalition Formation
Fast Indexes for Gapped Pattern Matching
Two-Way Restarting Automata and J-Monotonicity
Lessons in Software Evolution Learned by Listening to Smalltalk
Optimal Trees for Searching in Codebook
Delivery to Safety with Two Cooperating Robots
Towards a Characterization of Leaf Powers by Clique Arrangements
Data Mining and the KESO Project
New Support Size Bounds and Proximity Bounds for Integer Linear Programming
On the (High) Undecidability of Distributed Synthesis Problems
Unambiguous UML Composite Structures: The OMEGA2 Experience
Automatic Verification of Heap Manipulation Using Separation Logic
Aspect, Rich, and Anemic Domain Models in Enterprise Information Systems
SOS Rule Formats for Idempotent Terms and Idempotent Unary Operators
Efficient Error-Correcting Codes for Sliding Windows
MAK€- A System for Modelling, Optimising, and Analyzing Production in Small and Medium Enterprises
Feasible Real Random Access Machines
A Quick Tour of Word Sense Disambiguation, Induction and Related Approaches
Multi-stranded String Assembling Systems
Expressiveness of Multiple Heads in CHR
Towards Combining Multitask and Multilingual Learning
The Minimum Reload s-tPath/Trail/Walk Problems
Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time
SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings
A Visual Approach to VDM
Choosing Reference Views for Image-Based Representation
Tabu search for the BWC problem
Indexing Factors with Gaps
Hopfield Languages
Computer Visualization - Concepts, Trends and Current Research
SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings
Practical Deniable Encryption
Fuzzy Set Theory and Medical Expert Systems: Survey and Model
Optimizing Winning Strategies in Regular Infinite Games
Exact Quantum Query Complexity of \text EXACT_k, l^n
Online b-Matching with Stochastic Rewards
Iterated Uniform Finite-State Transducers on Unary Languages
Holey Graphs: Very Large Betti Numbers are Testable
Iterative Methods for Unsymmetric Linear Systems
On the Klee's Measure Problem in Small Dimensions
Fast Practical Compression of Deterministic Finite Automata
Pattern Equations and Equations with Stuttering
On the Unification of Process Semantics: Observational Semantics
Empirical Evaluation of Strategies to Detect Logical Change Dependencies
Threshold Privacy Preserving Keyword Searches
Lackadaisical Quantum Walks with Multiple Marked Vertices
Graph Clustering with Surprise: Complexity and Exact Solutions
Advice Complexity: Quantitative Approach to A-Priori Information - (Extended Abstract)
Extending Database Technology
ISICIL: Semantics and Social Networks for Business Intelligence
Using Extensible Heterogeneous Database Transformers
Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers
A Fully Generic Approach for Realizing the Adaptive Web
Improved ROCK for Text Clustering Using Asymmetric Proximity
Serial and Parallel Multilevel Graph Partitioning Using Fixed Centers
Probabilistic Acceptors for Languages over Infinite Words
Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks
The Quantum Complexity of Group Testing
Interaction and Realizability
Compiling Horn-Clause Rules in IBM's Business System 12 and Early Experiment in Declarativeness
Improving Classification Performance with Focus on the Complex Areas
Group Search on the Line
Longest Common Prefixes with k-Mismatches and Applications
Avoiding Forbidden Submatrices by Row Deletions
Sorting Networks on Restricted Topologies
Lemmatizer for Document Information Retrieval Systems in JAVA
Competitive Contract Net Protocol
SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings
Destructive Rule-Based Properties and First-Order Logic
Algorithms Based on Randomization and Linear and Semidefinite Programming
On Pumping Problems for Unary Regular Languages
SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings
DAG Scheduling in the BSP Model
Symbolic OBDD-Based Reachability Analysis Needs Exponential Space
A Theory of Game Trees, Based on Solution Trees
A Language for Reliable Service Composition
Beyond the Turing Limit: Evolving Interactive Systems
Hardness of Bounding Influence via Graph Modification
Early Prediction of Test Case Verdict with Word Embeddings vs. Bag-of-Words
Properties and Application of Nondeterministic Quantum Query Algorithms
Reuse Methods for Construction of Parallel Software
Toolkits for Agent Development by Undergraduates and Non-Programmers
Agreement Technologies
The Dos and Dont's of Crowdsourcing Software Development
Formal Methods in Practice: A Comparison of Two Support Systems for Proof
What NARX Networks Can Compute
Pathways to Tractability for Geometric Thickness
Proceedings of the SOFSEM 2020 Doctoral Student Research Forum co-located with the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), Limassol, Cyprus, January 20-24, 2020
ProofBook: An Online Social Network Based on Proof-of-Work and Friend-Propagation
Domain Name System as a Memory and Communication Medium
Data Mining Extension for Object-Oriented Query Language
Attribute-Based Encryption Optimized for Cloud Computing
Fast Primality Testing for Integers That Fit into a Machine Word
Factoring and Testing Primes in Small Space
The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps
On Architecture Specification
Bounding Lamport's Bakery Algorithm
On the Approximation Ratio of the Path Matching Christofides Algorithm
Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs
Hierarchical b-Matching
Local Routing in Convex Subdivisions
System Infrastructure for Digital Libraries: A Survey and Outlook
Searching Paths of Constant Bandwidth
Efficient Similarity Search by Combining Indexing and Caching Strategies
Lower Bounds for the Virtual Path Layout Problem in ATM Networks
A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
Reachability Problems for PAMs
Team Semantics and Recursive Enumerability
A Spectral Algorithm for Finding Maximum Cliques in Dense Random Intersection Graphs
Extension of Rescheduling Based on Minimal Graph Cut
Maximal α-Gapped Repeats in a Fibonacci String
Computing Longest Single-arm-gapped Palindromes in a String
Service Oriented Architecture Pitfalls
On d -Regular Schematization of Embedded Paths
Stepping Stones to an Information Society
Agreement Problems in Fault-Tolerant Distributed Systems
Software Production: A New Paradigm for Software Engineering Research
SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings
Modeling of Hypermedia Applications
On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge
Inference in Rule-Based Systems by Interpolation and Extrapolation Revisited
A Light-Weight Tool for the Self-assessment of Security Compliance in Software Development - An Industry Case
AOBA: An Online Benchmark Tool for Algorithms in Stringology
SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24 - December 1, 2001, Proceedings
Small Independent Edge Dominating Sets in Graphs of Maximum Degree Three
The Complexity of Small Universal Turing Machines: A Survey
Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails
Experience with Chorus
An Extension of Linear-size Suffix Tries for Parameterized Strings
VCD: A Visual Formalism for Specification of Heterogeneous Software Architectures
Taming the Complexity of Inductive Logic Programming
Pseudoknot-Generating Operation
Group Input Machine
State Complexity Advantages of Ultrametric Automata
Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, the 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015) , Pec pod Snezkou, Czech Republic, January 24-29, 2015
Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds
On Approximating the d -Girth of a Graph
RAQ: A Range-Queriable Distributed Data Structure
A Flexible Policy Architecture for Mobile Agents
Invited Talk: Resilient Distributed Algorithms
Nondeterministic Modal Interfaces
On creating a trusted and distributed data source environment
Zero-Overhead Exeption Handling Using Metaprogramming
Efficient Group Key Agreement for Dynamic TETRA Networks
Feature Selection by Reordering