Pages that link to "Item:Q3525549"

The following pages link to Mathematical Foundations of Computer Science 2007 (Q3525549):

Displaying 50 items.

• How To Be Fickle (Q3525550) (← links)
• Finite Model Theory on Tame Classes of Structures (Q3525551) (← links)
• Minimum Cycle Bases in Graphs Algorithms and Applications (Q3525552) (← links)
• Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes (Q3525553) (← links)
• Expander Properties and the Cover Time of Random Intersection Graphs (Q3525554) (← links)
• Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs (Q3525555) (← links)
• Transition Graphs of Rewriting Systems over Unranked Trees (Q3525557) (← links)
• Rewriting Conjunctive Queries Determined by Views (Q3525558) (← links)
• Approximation Algorithms for the Maximum Internal Spanning Tree Problem (Q3525559) (← links)
• New Approximability Results for 2-Dimensional Packing Problems (Q3525560) (← links)
• On Approximation of Bookmark Assignments (Q3525561) (← links)
• Height-Deterministic Pushdown Automata (Q3525562) (← links)
• Minimizing Variants of Visibly Pushdown Automata (Q3525563) (← links)
• Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids (Q3525564) (← links)
• Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete (Q3525565) (← links)
• NP by Means of Lifts and Shadows (Q3525566) (← links)
• The Complexity of Solitaire (Q3525567) (← links)
• Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems (Q3525568) (← links)
• Space-Conscious Compression (Q3525569) (← links)
• Small Alliances in Graphs (Q3525571) (← links)
• The Maximum Solution Problem on Graphs (Q3525572) (← links)
• What Are Iteration Theories? (Q3525573) (← links)
• Properties Complementary to Program Self-reference (Q3525574) (← links)
• Dobrushin Conditions for Systematic Scan with Block Dynamics (Q3525575) (← links)
• On the Complexity of Computing Treelength (Q3525576) (← links)
• On Time Lookahead Algorithms for the Online Data Acknowledgement Problem (Q3525577) (← links)
• Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods (Q3525578) (← links)
• Towards a Rice Theorem on Traces of Cellular Automata (Q3525579) (← links)
• Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority (Q3525580) (← links)
• Public Key Identification Based on the Equivalence of Quadratic Forms (Q3525581) (← links)
• Reachability Problems in Quaternion Matrix and Rotation Semigroups (Q3525582) (← links)
• VPSPACE and a Transfer Theorem over the Complex Field (Q3525583) (← links)
• Efficient Provably-Secure Hierarchical Key Assignment Schemes (Q3525584) (← links)
• Nearly Private Information Retrieval (Q3525586) (← links)
• Packing and Squeezing Subgraphs into Planar Graphs (Q3525587) (← links)
• Dynamic Matchings in Convex Bipartite Graphs (Q3525588) (← links)
• Communication in Networks with Random Dependent Faults (Q3525589) (← links)
• Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults (Q3525590) (← links)
• A Linear Time Algorithm for the k Maximal Sums Problem (Q3525591) (← links)
• A Lower Bound of 1 + φ for Truthful Scheduling Mechanisms (Q3525592) (← links)
• Analysis of Maximal Repetitions in Strings (Q3525593) (← links)
• Series-Parallel Languages on Scattered and Countable Posets (Q3525594) (← links)
• Traces of Term-Automatic Graphs (Q3525595) (← links)
• State Complexity of Basic Operations on Suffix-Free Regular Languages (Q3525596) (← links)
• Exact Algorithms for L(2,1)-Labeling of Graphs (Q3525597) (← links)
• On (k,ℓ)-Leaf Powers (Q3525598) (← links)
• An Improved Claw Finding Algorithm Using Quantum Walk (Q3525599) (← links)
• Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument (Q3525600) (← links)
• On the Complexity of Game Isomorphism (Q3525601) (← links)
• Hardness Results for Tournament Isomorphism and Automorphism (Q3525602) (← links)