Pages that link to "Item:Q2938089"

The following pages link to SOFSEM 2014: Theory and Practice of Computer Science (Q2938089):

Displaying 30 items.

• Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems (Q2938090) (← links)
• Advice Complexity: Quantitative Approach to A-Priori Information (Q2938091) (← links)
• Matching of Images of Non-planar Objects with View Synthesis (Q2938093) (← links)
• Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth (Q2938095) (← links)
• Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem (Q2938096) (← links)
• On the Power of Advice and Randomization for the Disjoint Path Allocation Problem (Q2938097) (← links)
• Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs (Q2938098) (← links)
• Error-Pruning in Interface Automata (Q2938099) (← links)
• Exact Algorithms to Clique-Colour Graphs (Q2938100) (← links)
• Graph Clustering with Surprise: Complexity and Exact Solutions (Q2938102) (← links)
• On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms (Q2938103) (← links)
• Active Learning of Recursive Functions by Ultrametric Algorithms (Q2938104) (← links)
• Efficient Error-Correcting Codes for Sliding Windows (Q2938105) (← links)
• Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes (Q2938106) (← links)
• Bidimensionality of Geometric Intersection Graphs (Q2938107) (← links)
• Attack against a Pairing Based Anonymous Authentication Protocol (Q2938108) (← links)
• Finding Disjoint Paths in Split Graphs (Q2938109) (← links)
• A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing (Q2938110) (← links)
• A Stronger Square Conjecture on Binary Words (Q2938111) (← links)
• Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints (Q2938114) (← links)
• Deterministic Verification of Integer Matrix Multiplication in Quadratic Time (Q2938115) (← links)
• Probabilistic Admissible Encoding on Elliptic Curves - Towards PACE with Generalized Integrated Mapping (Q2938116) (← links)
• An Algebraic Framework for Modeling of Reactive Rule-Based Intelligent Agents (Q2938118) (← links)
• Parameterized Prefix Distance between Regular Languages (Q2938119) (← links)
• Ordered Restarting Automata for Picture Languages (Q2938120) (← links)
• Unary NFAs with Limited Nondeterminism (Q2938121) (← links)
• A New Plane-Sweep Algorithm for the K-Closest-Pairs Query (Q2938124) (← links)
• Shortest Unique Substrings Queries in Optimal Time (Q2938125) (← links)
• Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages (Q2938126) (← links)
• Fitting Planar Graphs on Planar Maps (Q5892055) (← links)