Pages that link to "Item:Q3401085"
From MaRDI portal
The following pages link to SOFSEM 2010: Theory and Practice of Computer Science (Q3401085):
Displayed 36 items.
- Forcing Monotonicity in Parameterized Verification: From Multisets to Words (Q3401086) (← links)
- Taming the Complexity of Inductive Logic Programming (Q3401087) (← links)
- A Rule Format for Unit Elements (Q3401088) (← links)
- Approximability of Edge Matching Puzzles (Q3401089) (← links)
- A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks (Q3401090) (← links)
- Fast Arc-Annotated Subsequence Matching in Linear Space (Q3401091) (← links)
- Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs (Q3401092) (← links)
- A Kernel for Convex Recoloring of Weighted Forests (Q3401093) (← links)
- Symbolic OBDD-Based Reachability Analysis Needs Exponential Space (Q3401094) (← links)
- On Pattern Density and Sliding Block Code Behavior for the Besicovitch and Weyl Pseudo-distances (Q3401095) (← links)
- On a Labeled Vehicle Routing Problem (Q3401097) (← links)
- Improved Matrix Interpretation (Q3401099) (← links)
- Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays (Q3401100) (← links)
- Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time (Q3401102) (← links)
- Destructive Rule-Based Properties and First-Order Logic (Q3401103) (← links)
- Parallel Randomized Load Balancing: A Lower Bound for a More General Model (Q3401104) (← links)
- Linear Complementarity Algorithms for Infinite Games (Q3401105) (← links)
- Mixing Coverability and Reachability to Analyze VASS with One Zero-Test (Q3401106) (← links)
- Fast and Compact Prefix Codes (Q3401107) (← links)
- New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes (Q3401108) (← links)
- Smooth Optimal Decision Strategies for Static Team Optimization Problems and Their Approximations (Q3401109) (← links)
- Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph (Q3401110) (← links)
- On the Complexity of the Highway Pricing Problem (Q3401111) (← links)
- Optimum Broadcasting in Complete Weighted-Vertex Graphs (Q3401112) (← links)
- On Contracting Graphs to Fixed Pattern Graphs (Q3401113) (← links)
- Dynamic Edit Distance Table under a General Weighted Cost Function (Q3401114) (← links)
- A Complete Symbolic Bisimulation for Full Applied Pi Calculus (Q3401115) (← links)
- Picture Recognizability with Automata Based on Wang Tiles (Q3401116) (← links)
- Unilateral Orientation of Mixed Graphs (Q3401117) (← links)
- CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions (Q3401118) (← links)
- Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup (Q3401119) (← links)
- An Amortized Search Tree Analysis for k-Leaf Spanning Tree (Q3401120) (← links)
- Approximate Structural Consistency (Q3401121) (← links)
- Comparison of Scoring and Order Approach in Description Logic $\mathcal{EL(D)}$ (Q3401123) (← links)
- Finding and Certifying Loops (Q3401124) (← links)
- Vertex Ranking with Capacity (Q3401125) (← links)