On the public citation graph
FSTTCS 2006 : foundations of software technology and theoretical computer science : 26th International Conference, Kolkata, India, December 13-15, 2006 : proceedings
0 signed · 93 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11944836_29openalex-snapshot
On Reduction Criteria for Probabilistic Reward Models
inferredcites →https://doi.org/10.1007/11944836_38openalex-snapshot
Game Semantics for Higher-Order Concurrency
inferredcites →https://doi.org/10.1007/11944836_6openalex-snapshot
Coresets for Discrete Integration and Clustering
inferredcites →https://doi.org/10.1007/11944836_7openalex-snapshot
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
inferredcites →https://doi.org/10.1007/11944836_9openalex-snapshot
Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs
inferredcites →https://doi.org/10.1016/j.ic.2010.03.003openalex-snapshot
Context-sensitive dependency pairs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_9openalex-snapshot
Temporal Mode-Checking for Runtime Monitoring of Privacy Policies
inferred← citeshttps://doi.org/10.1007/978-3-319-11164-3_9openalex-snapshot
On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_10openalex-snapshot
On Time with Minimal Expected Cost!
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_25openalex-snapshot
A Game-Theoretic Approach to Simulation of Data-Parameterized Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-16310-9_12openalex-snapshot
The Invariant Refinement Method
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_12openalex-snapshot
Networks Become Navigable as Nodes Move and Forget
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_9openalex-snapshot
Usable Rules for Context-Sensitive Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_13openalex-snapshot
A Decidable Temporal Logic of Repeating Values
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_6openalex-snapshot
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_74openalex-snapshot
Bounded Depth Data Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_5openalex-snapshot
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
inferred← citeshttps://doi.org/10.1007/978-3-540-75454-1_8openalex-snapshot
Counter-Free Input-Determined Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-76788-6_7openalex-snapshot
Improving the Time Complexity of Matsui’s Linear Cryptanalysis
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_25openalex-snapshot
Algorithms for Multi-criteria One-Sided Boundary Labeling
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_3openalex-snapshot
The Complexity of Nash Equilibria in Infinite Multiplayer Games
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_34openalex-snapshot
Model Checking Freeze LTL over One-Counter Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-79104-1_26openalex-snapshot
Computational Soundness of Non-Malleable Commitments
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_42openalex-snapshot
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-85114-1_7openalex-snapshot
Generating Compact MTBDD-Representations from Probmela Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-85778-5_4openalex-snapshot
Infinite Runs in Weighted Timed Automata with Energy Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_33openalex-snapshot
Impartial Anticipation in Runtime-Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_34openalex-snapshot
Run-Time Monitoring of Electronic Contracts
inferred← citeshttps://doi.org/10.1007/978-3-540-89247-2_6openalex-snapshot
Checking Traces for Regulatory Conformance
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_44openalex-snapshot
Improving Context-Sensitive Dependency Pairs
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_15openalex-snapshot
Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-93920-7_14openalex-snapshot
Using Temporal Logic to Integrate Goals and Qualitative Preferences into Agent Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_16openalex-snapshot
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_9openalex-snapshot
Matching Trace Patterns with Regular Policies
inferred← citeshttps://doi.org/10.1007/978-3-642-01702-5_16openalex-snapshot
Statistical Model Checking of Mixed-Analog Circuits with an Application to a Third Order Δ − Σ Modulator
inferred← citeshttps://doi.org/10.1007/978-3-642-02002-5_9openalex-snapshot
Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_9openalex-snapshot
Searching Trees: An Essay
inferred← citeshttps://doi.org/10.1007/978-3-642-02138-1_2openalex-snapshot
Keep It Small, Keep It Real: Efficient Run-Time Verification of Web Service Compositions
inferred← citeshttps://doi.org/10.1007/978-3-642-02348-4_20openalex-snapshot
VMTL–A Modular Termination Laboratory
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_50openalex-snapshot
Browser-Based Enforcement of Interface Contracts in Web Applications with BeepBeep
inferred← citeshttps://doi.org/10.1007/978-3-642-02716-1_7openalex-snapshot
A Novel Architecture for Situation Awareness Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-02737-6_2openalex-snapshot
Weighted versus Probabilistic Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_21openalex-snapshot
The Tile Complexity of Linear Assemblies
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_20openalex-snapshot
LTL Path Checking Is Efficiently Parallelizable
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_20openalex-snapshot
On Map Labeling with Leaders
inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_6openalex-snapshot
A First-Order Policy Language for History-Based Transaction Monitoring
inferred← citeshttps://doi.org/10.1007/978-3-642-03745-0_19openalex-snapshot
Random Number Selection in Self-assembly
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_23openalex-snapshot
On Model Checking Boolean BI
inferred← citeshttps://doi.org/10.1007/978-3-642-04174-7_43openalex-snapshot
Learning the Difference between Partially Observable Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-04222-5_9openalex-snapshot
Runtime Verification Using a Temporal Description Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-04368-0_10openalex-snapshot
Safe Runtime Verification of Real-Time Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-04444-1_35openalex-snapshot
Computationally Sound Analysis of a Probabilistic Contract Signing Protocol
inferred← citeshttps://doi.org/10.1007/978-3-642-04694-0_13openalex-snapshot
DMaC: Distributed Monitoring and Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-04761-9_24openalex-snapshot
Synthesis of Fault-Tolerant Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-04766-4_20openalex-snapshot
Generating In-Line Monitors for Rabin Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-10622-4_11openalex-snapshot
A Dolev-Yao Model for Zero Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_2openalex-snapshot
Verification, Performance Analysis and Controller Synthesis for Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-11999-6_4openalex-snapshot
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-12459-4_19openalex-snapshot
A User Interface for a Game-Based Protocol Verification Tool
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_1openalex-snapshot
Policy Monitoring in First-Order Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-14706-7_11openalex-snapshot
Using Equivalence Relations for Corrective Enforcement of Security Policies
inferred← citeshttps://doi.org/10.1007/978-3-642-15297-9_7openalex-snapshot
Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games
inferred← citeshttps://doi.org/10.1007/978-3-642-15300-6_13openalex-snapshot
Periodic Multi-labeling of Public Transit Lines
inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_14openalex-snapshot
Nash Equilibria for Reachability Objectives in Multi-player Timed Games
inferred← citeshttps://doi.org/10.1007/978-3-642-16310-4_3openalex-snapshot
Proving Termination in the Context-Sensitive Dependency Pair Framework
inferred← citeshttps://doi.org/10.1007/978-3-642-18305-8_10openalex-snapshot
Randomized Self Assembly of Rectangular Nano Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-19718-5_19openalex-snapshot
A Testing Theory for a Higher-Order Cryptographic Language
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_25openalex-snapshot
Exact Algorithm for the Maximum Induced Planar Subgraph Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-24364-6_3openalex-snapshot
Size-Change Termination and Satisfiability for Linear-Time Temporal Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-28641-4_2openalex-snapshot
Security Protocol Verification: Symbolic and Computational Models
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_6openalex-snapshot
Ramsey-Based Analysis of Parity Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-29101-2_5openalex-snapshot
Computational Soundness of Indistinguishability Properties without Computable Parsing
inferred← citeshttps://doi.org/10.1007/978-3-642-29860-8_4openalex-snapshot
Teaching Runtime Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-32894-7_6openalex-snapshot
An Introduction to Tile-Based Self-assembly
inferred← citeshttps://doi.org/10.1007/978-3-642-35452-6_7openalex-snapshot
An O ∗ (1.4786 n )-Time Algorithm for the Maximum Induced Matching Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-36046-6_14openalex-snapshot
Parameterized Algorithms for Stochastic Steiner Tree Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_22openalex-snapshot
Ramsey Goes Visibly Pushdown
inferred← citeshttps://doi.org/10.1007/978-3-642-39721-9_2openalex-snapshot
Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-40787-1_11openalex-snapshot
Impartiality and Anticipation for Monitoring of Visibly Context-Free Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-54792-8_3openalex-snapshot
Computational Soundness Results for ProVerif
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_7openalex-snapshot
Luatodonotes: Boundary Labeling for Annotations in Texts
inferred← citeshttps://doi.org/10.1007/s41468-024-00192-7openalex-snapshot
Adaptive approximation of persistent homology
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.05.002openalex-snapshot
A survey of stochastic ω-regular games
inferred← citeshttps://doi.org/10.1016/j.scico.2015.02.008openalex-snapshot
A graph-based algorithm for three-way merging of ordered collections in EMF models
inferred← citeshttps://doi.org/10.1016/j.softx.2025.102144openalex-snapshot
MergeBot: A platform of semi-structured merge conflict resolution for C/C++ code
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115546openalex-snapshot
Tight length theorems for multiset extensions of Higman’s lemma
inferred← citeshttps://doi.org/10.1109/tpami.2011.27openalex-snapshot
C^4: Exploring Multiple Solutions in Graphical Models by Cluster Sampling
inferred← citeshttps://doi.org/10.1145/2933575.2933598openalex-snapshot
Towards Completeness via Proof Search in the Linear Time μ-calculus
inferred← citeshttps://doi.org/10.1145/3467001.3467003openalex-snapshot
Synthesis of equilibria in infinite-duration games on graphs
inferred← citeshttps://doi.org/10.1613/jair.1.12539openalex-snapshot
Approximating Perfect Recall when Model Checking Strategic Abilities: Theory and Applications
inferred← citeshttps://doi.org/10.70675/5de92b0aza63dz4168za9b0zec36396c88ffopenalex-snapshot
Weighted timed games : decidability, randomness and robustness
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.