On the public citation graph
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference, Mumbai, India, December 15-17, 2003. Proceedings
0 signed · 129 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/978-3-540-24597-1_15openalex-snapshot
Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models
inferredcites →https://doi.org/10.1007/978-3-540-24597-1_20openalex-snapshot
Joint Separation of Geometric Clusters and the Extreme Irregularities of Regular Polyhedra
inferredcites →https://doi.org/10.1007/978-3-540-24597-1_21openalex-snapshot
On the Covering Steiner Problem
inferredcites →https://doi.org/10.1007/978-3-540-24597-1_22openalex-snapshot
Minimality Results for the Spatial Logics
inferredcites →https://doi.org/10.1007/978-3-540-24597-1_24openalex-snapshot
Efficient Algorithms for Abelian Group Isomorphism and Related Problems
inferredcites →https://doi.org/10.1007/978-3-540-24597-1_25openalex-snapshot
Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees
inferredcites →https://doi.org/10.1007/978-3-540-24597-1_36openalex-snapshot
Component-Based Construction of Deadlock-Free Systems
inferredcites →https://doi.org/10.1007/978-3-540-24597-1_37openalex-snapshot
Moderately Hard Functions: From Complexity to Spam Fighting
inferredcites →https://doi.org/10.1016/j.ic.2004.10.009openalex-snapshot
Quantum and classical complexity classes: Separations, collapses, and closure properties
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11496656_16openalex-snapshot
An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression
inferred← citeshttps://doi.org/10.1007/11533719_61openalex-snapshot
On-Line Algorithms for Market Equilibria
inferred← citeshttps://doi.org/10.1007/11539452_19openalex-snapshot
Selecting Theories and Recursive Protocols
inferred← citeshttps://doi.org/10.1007/11539452_33openalex-snapshot
Games Where You Can Play Optimally Without Any Memory
inferred← citeshttps://doi.org/10.1007/11539452_36openalex-snapshot
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
inferred← citeshttps://doi.org/10.1007/11554578_1openalex-snapshot
Justifying a Dolev-Yao Model Under Active Attacks
inferred← citeshttps://doi.org/10.1007/11562948_3openalex-snapshot
Some Perspectives of Infinite-State Verification
inferred← citeshttps://doi.org/10.1007/11590156_16openalex-snapshot
The MSO Theory of Connectedly Communicating Processes
inferred← citeshttps://doi.org/10.1007/11602613_77openalex-snapshot
Simulating Undirected st-Connectivity Algorithms on Uniform JAGs and NNJAGs
inferred← citeshttps://doi.org/10.1007/11609773_27openalex-snapshot
Verification of Well-Formed Communicating Recursive State Machines
inferred← citeshttps://doi.org/10.1007/11690634_10openalex-snapshot
On the μ-Calculus Augmented with Sabotage
inferred← citeshttps://doi.org/10.1007/11690634_2openalex-snapshot
A Theory for Observational Fault Tolerance
inferred← citeshttps://doi.org/10.1007/11690634_23openalex-snapshot
Parity Games Played on Transition Graphs of One-Counter Processes
inferred← citeshttps://doi.org/10.1007/11830924_17openalex-snapshot
Improved Algorithms for Data Migration
inferred← citeshttps://doi.org/10.1007/11885191_15openalex-snapshot
Compositional Reachability Analysis of Genetic Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_23openalex-snapshot
First-Order Logic on CPDA Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-07581-5_13openalex-snapshot
Timed and Probabilistic Model Checking over Phylogenetic Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-10082-1_3openalex-snapshot
Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_1openalex-snapshot
Intruder Theories (Ongoing Work)
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_7openalex-snapshot
Behavioral and Spatial Observations in a Logic for the π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_6openalex-snapshot
Towards Constructing Optimal Strip Move Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-27821-4_12openalex-snapshot
An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_33openalex-snapshot
Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities
inferred← citeshttps://doi.org/10.1007/978-3-540-30108-0_6openalex-snapshot
A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_25openalex-snapshot
Moving in a Crumbling Network: The Balanced Case
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_8openalex-snapshot
Parity and Exploration Games on Infinite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_17openalex-snapshot
Fisher Equilibrium Price with a Class of Concave Utility Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-30144-8_4openalex-snapshot
Low-Level Ideal Signatures and General Integrity Idealization
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_20openalex-snapshot
Model-Checking for Weighted Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-30477-7_11openalex-snapshot
Concurrency Combinators for Declarative Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_36openalex-snapshot
Decidability of MSO Theories of Tree Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_35openalex-snapshot
On Computing Reachability Sets of Process Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_26openalex-snapshot
On the (High) Undecidability of Distributed Synthesis Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_77openalex-snapshot
A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_17openalex-snapshot
Admissibility in Infinite Games
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_54openalex-snapshot
Associative-Commutative Deducibility Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_55openalex-snapshot
On the Automatic Analysis of Recursive Security Protocols with XOR
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_34openalex-snapshot
Challenges in the Automated Verification of Security Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_21openalex-snapshot
Assume-Guarantee Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-540-73196-2_1openalex-snapshot
Contracts for BIP: Hierarchical Interaction Models for Compositional Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_77openalex-snapshot
A Combinatorial Theorem for Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_4openalex-snapshot
Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-74510-5_6openalex-snapshot
Sequences of Level 1, 2, 3,..., k,...
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_15openalex-snapshot
MSO on the Infinite Binary Tree: Choice and Order
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_28openalex-snapshot
On the Complexity of Reasoning About Dynamic Policies
inferred← citeshttps://doi.org/10.1007/978-3-540-77505-8_12openalex-snapshot
Normal Proofs in Intruder Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_8openalex-snapshot
Computing Simulations over Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_17openalex-snapshot
Positional Strategies for Higher-Order Pushdown Parity Games
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_29openalex-snapshot
On the Reachability Analysis of Acyclic Networks of Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85762-4_15openalex-snapshot
Everything Is PSPACE-Complete in Interaction Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_3openalex-snapshot
Model Transformations in Decidability Proofs for Monadic Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_5openalex-snapshot
An Infinite Automaton Characterization of Double Exponential Time
inferred← citeshttps://doi.org/10.1007/978-3-540-88733-1_13openalex-snapshot
Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_9openalex-snapshot
From One Session to Many: Dynamic Tags for Security Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-92188-2_6openalex-snapshot
Active Objects and Distributed Components: Theory and Implementation
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-02002-5_2openalex-snapshot
Validating Integrity for the Ephemerizer’s Protocol with CL-Atse
inferred← citeshttps://doi.org/10.1007/978-3-642-02053-7_13openalex-snapshot
A Uniform Framework for Modeling and Verifying Components and Connectors
inferred← citeshttps://doi.org/10.1007/978-3-642-02348-4_10openalex-snapshot
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
inferred← citeshttps://doi.org/10.1007/978-3-642-02348-4_9openalex-snapshot
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case
inferred← citeshttps://doi.org/10.1007/978-3-642-02737-6_32openalex-snapshot
Branching-Time Temporal Logics with Minimal Model Quantifiers
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_2openalex-snapshot
The Reachability Problem over Infinite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_17openalex-snapshot
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_20openalex-snapshot
Constrained Reachability of Process Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-03829-7_6openalex-snapshot
The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
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-04420-5_18openalex-snapshot
Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-10772-6_9openalex-snapshot
Correcting and Improving the NP Proof for Cryptographic Protocol Insecurity
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_9openalex-snapshot
The Complexity of Reachability in Randomized Sabotage Games
inferred← citeshttps://doi.org/10.1007/978-3-642-13754-9_11openalex-snapshot
An Automata-Theoretic Approach to Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_8openalex-snapshot
Linear Orders in the Pushdown Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-642-15164-4_1openalex-snapshot
Infinite Coordination Games
inferred← citeshttps://doi.org/10.1007/978-3-642-15240-5_26openalex-snapshot
A Game-Theoretic Approach to Routing under Adversarial Conditions
inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_35openalex-snapshot
A Communication Based Model for Games of Imperfect Information
inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_4openalex-snapshot
Taming Distributed Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15643-4_3openalex-snapshot
Synthesis: Words and Traces
inferred← citeshttps://doi.org/10.1007/978-3-642-16561-0_15openalex-snapshot
Design and Verification of Systems with Exogenous Coordination Using Vereofy
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_27openalex-snapshot
Liveness of Communicating Transactions (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-18222-8_3openalex-snapshot
Bounded Parametric Model Checking for Elementary Net Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_22openalex-snapshot
GAVS+: An Open Platform for the Research of Algorithmic Game Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_34openalex-snapshot
A Compositional Framework for Controller Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-24431-5_17openalex-snapshot
Hierarchical Modeling and Formal Verification. An Industrial Case Study Using Reo and Vereofy
inferred← citeshttps://doi.org/10.1007/978-3-642-25318-8_17openalex-snapshot
Macro Tree Transformations of Linear Size Increase Achieve Cost-Optimal Parallelism
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-29420-4_14openalex-snapshot
Diffie-Hellman without Difficulty
inferred← citeshttps://doi.org/10.1007/978-3-642-30065-3_11openalex-snapshot
Transactional Correctness for Secure Nested Transactions
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_17openalex-snapshot
Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_18openalex-snapshot
A Saturation Method for Collapsible Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_6openalex-snapshot
Simple Models for Recursive Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-32621-9_11openalex-snapshot
Moving Arrows and Four Model Checking Results
inferred← citeshttps://doi.org/10.1007/978-3-642-33167-1_8openalex-snapshot
Deciding Security for a Fragment of ASLan
inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_8openalex-snapshot
A Context-Free Linear Ordering with an Undecidable First-Order Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-33512-9_2openalex-snapshot
Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-35722-0_10openalex-snapshot
A Modal BI Logic for Dynamic Resource Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-38592-6_12openalex-snapshot
An Abstract Framework for Deadlock Prevention in BIP
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_12openalex-snapshot
Coalgebraic Announcement Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_29openalex-snapshot
Algebras, Automata and Logic for Languages of Labeled Birooted Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-41157-1_11openalex-snapshot
An Algebra for Symbolic Diffie-Hellman Protocol Analysis
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_3openalex-snapshot
Deterministic Negotiations: Concurrency for Free
inferred← citeshttps://doi.org/10.1007/978-3-662-46666-7_10openalex-snapshot
Leakiness is Decidable for Well-Founded Protocols
inferred← citeshttps://doi.org/10.1016/j.apal.2005.12.004openalex-snapshot
Iterated pushdown automata and sequences of rational numbers
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.042openalex-snapshot
Global and Local Graph Modifiers
inferred← citeshttps://doi.org/10.1016/j.ic.2007.08.003openalex-snapshot
Transducer-based analysis of cryptographic protocols
inferred← citeshttps://doi.org/10.1016/j.jal.2014.07.005openalex-snapshot
Constraint LTL satisfiability checking without automata
inferred← citeshttps://doi.org/10.1016/j.scico.2005.02.008openalex-snapshot
Abstract interpretation of programs as Markov decision processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.024openalex-snapshot
Games with winning conditions of high Borel complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.031openalex-snapshot
Tree-walking automata cannot be determinized
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.018openalex-snapshot
An auction-based market equilibrium algorithm for a production model
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.10.020openalex-snapshot
Regular sets over extended tree structures
inferred← citeshttps://doi.org/10.1145/2935764.2935775openalex-snapshot
Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time
inferred← citeshttps://doi.org/10.2168/lmcs-3(2:3)2007openalex-snapshot
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
inferred← citeshttps://doi.org/10.22215/etd/2014-10282openalex-snapshot
Semi-automated Hypothesis Evaluation Using Semantic Technologies
inferred← citeshttps://doi.org/10.7494/csci.2023.24.1.4656openalex-snapshot
A NOTE ON HARDNESS OF MULTIPROCESSOR SCHEDULING WITH SCHEDULING SOLUTION SPACE TREE
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.