On the public citation graph

LATIN 2000: Theoretical Informatics

0 signed · 82 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/10719839_39openalex-snapshot
Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11532323_25openalex-snapshot
A Modification of the Landau-Vishkin Algorithm Computing Longest Common Extensions via Suffix Arrays
inferred← citeshttps://doi.org/10.1007/11604686_7openalex-snapshot
Minimizing NLC-Width is NP-Complete
inferred← citeshttps://doi.org/10.1007/11861201_22openalex-snapshot
State-Efficient Firing Squad Synchronization Protocols for Communication-Restricted Cellular Automata
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_22openalex-snapshot
Pattern-Based Abstraction for Verifying Secrecy in Protocols
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_33openalex-snapshot
On Name Generation and Set-Based Analysis in the Dolev-Yao Model
inferred← citeshttps://doi.org/10.1007/978-3-319-02432-5_17openalex-snapshot
Minimal Discriminating Words Problem Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-07001-8_16openalex-snapshot
Risk-Adjusted On-line Portfolio Selection
inferred← citeshttps://doi.org/10.1007/978-3-319-07566-2_4openalex-snapshot
Computing Minimal and Maximal Suffixes of a Substring Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-09698-8_23openalex-snapshot
Measuring Communication in Automata Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-09955-2_26openalex-snapshot
Exact Evaluation of Stochastic Watersheds: From Trees to General Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_58openalex-snapshot
A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24592-6_7openalex-snapshot
Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_13openalex-snapshot
The Verification of Probabilistic Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24855-2_19openalex-snapshot
An Effective Chromosome Representation for Evolving Flexible Job Shop Schedules
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_26openalex-snapshot
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_24openalex-snapshot
Forward Reachability Analysis of Timed Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-30219-3_38openalex-snapshot
Finding Optimal Pairs of Patterns
inferred← citeshttps://doi.org/10.1007/978-3-540-39763-2_33openalex-snapshot
Match Chaining Algorithms for cDNA Mapping
inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_1openalex-snapshot
Deciding Monotonic Games
inferred← citeshttps://doi.org/10.1007/978-3-540-69068-9_17openalex-snapshot
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
inferred← citeshttps://doi.org/10.1007/978-3-540-71229-9_14openalex-snapshot
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-71618-1_61openalex-snapshot
A Simple and Compact Algorithm for the RMQ and Its Application to the Longest Common Repeat Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_6openalex-snapshot
Rewriting Approximations for Fast Prototyping of Static Analyzers
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_14openalex-snapshot
Is Observational Congruence Axiomatisable in Equational Horn Logic?
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_17openalex-snapshot
Visibly Pushdown Languages and Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_6openalex-snapshot
Dynamic Distance Hereditary Graphs Using Split Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_36openalex-snapshot
Improved Bounds for Range Mode and Range Median Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-85654-2_12openalex-snapshot
On the Evaluation of Large and Sparse Graph Reachability Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_14openalex-snapshot
Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_60openalex-snapshot
From Gene Trees to Species Trees through a Supertree Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_11openalex-snapshot
Efficient Data Structures for the Orthogonal Range Successor Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_9openalex-snapshot
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
inferred← citeshttps://doi.org/10.1007/978-3-642-03784-9_30openalex-snapshot
Practical Algorithms for the Longest Common Extension Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-11266-9_25openalex-snapshot
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-12450-1_4openalex-snapshot
Approximation Algorithms for Multiple Strip Packing
inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_7openalex-snapshot
A Fast Longest Common Subsequence Algorithm for Similar Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_26openalex-snapshot
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-14518-6_10openalex-snapshot
An O(M(n) logn) Algorithm for the Jacobi Symbol
inferred← citeshttps://doi.org/10.1007/978-3-642-15349-5_4openalex-snapshot
Lossy Counter Machines Decidability Cheat Sheet
inferred← citeshttps://doi.org/10.1007/978-3-642-15364-8_24openalex-snapshot
Efficient SLCA-Based Keyword Search on XML Databases: An Iterative-Skip Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-16321-0_6openalex-snapshot
String Retrieval for Multi-pattern Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_18openalex-snapshot
Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-21260-4_23openalex-snapshot
Algorithms for Rapid Error Correction for the Gene Duplication Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_52openalex-snapshot
Succinct 2D Dictionary Matching with No Slowdown
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_25openalex-snapshot
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-24583-1_40openalex-snapshot
Compressed Indexes for Aligned Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-24583-1_9openalex-snapshot
Approximate Point Set Pattern Matching with L p -Norm
inferred← citeshttps://doi.org/10.1007/978-3-642-25318-8_13openalex-snapshot
A Non-iterative Data-Flow Algorithm for Computing Liveness Sets in Strict SSA Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_16openalex-snapshot
Path Queries in Weighted Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_6openalex-snapshot
Contraction-Based Steiner Tree Approximations in Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_60openalex-snapshot
Efficient Algorithms for the Weighted k-Center Problem on a Real Line
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_9openalex-snapshot
Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_27openalex-snapshot
Space-Efficient Top-k Document Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-642-31265-6_15openalex-snapshot
Document Listing for Queries with Excluded Pattern
inferred← citeshttps://doi.org/10.1007/978-3-642-31927-3_15openalex-snapshot
Phylogenetic Distance Computation Using CUDA
inferred← citeshttps://doi.org/10.1007/978-3-642-35734-3_11openalex-snapshot
Edit Distance for XML Information Retrieval: Some Experiments on the Datacentric Track of INEX 2011
inferred← citeshttps://doi.org/10.1007/978-3-642-36973-5_14openalex-snapshot
DTD Based Costs for Tree-Edit Distance in Structured Information Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-642-38527-8_3openalex-snapshot
Design of Practical Succinct Data Structures for Large Data Collections
inferred← citeshttps://doi.org/10.1007/978-3-642-38905-4_1openalex-snapshot
Forty Years of Text Indexing
inferred← citeshttps://doi.org/10.1007/978-3-642-38905-4_22openalex-snapshot
Time-Space Trade-Offs for the Longest Common Substring Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_21openalex-snapshot
Array Range Queries
inferred← citeshttps://doi.org/10.1007/s10009-005-0189-6openalex-snapshot
Pattern-based abstraction for verifying secrecy in protocols
inferred← citeshttps://doi.org/10.1016/j.cej.2024.152703openalex-snapshot
Green engineered biomaterials for bone repair and regeneration: Printing technologies and fracture analysis
inferred← citeshttps://doi.org/10.1016/j.cie.2012.01.003openalex-snapshot
Tabu search and lower bound for an industrial complex shop scheduling problem
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.08.004openalex-snapshot
Bichromatic 2-center of pairs of points
inferred← citeshttps://doi.org/10.1016/j.dam.2023.06.040openalex-snapshot
The Overfull Conjecture on split-comparability and split-interval graphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.03.050openalex-snapshot
Algorithmic trading for online portfolio selection under limited market liquidity
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.09.015openalex-snapshot
On One-way One-bit O (One)-message Cellular Automata
inferred← citeshttps://doi.org/10.1016/j.esr.2024.101393openalex-snapshot
Promoting the "Chinese experience" of carbon neutrality—Evidence of carbon emission pilot governance in Guangdong Province based on the EIO-LCA model
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105082openalex-snapshot
Building a small and informative phylogenetic supertree
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.05.005openalex-snapshot
Computing the K-terminal reliability of directed path graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.03.003openalex-snapshot
Rank-width and vertex-minors
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.10.006openalex-snapshot
Approximating clique-width and branch-width
inferred← citeshttps://doi.org/10.1016/j.jnt.2022.09.013openalex-snapshot
A physical study of the LLL algorithm
inferred← citeshttps://doi.org/10.1016/j.patrec.2019.10.008openalex-snapshot
Removing non-significant regions in hierarchical clustering and segmentation
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.024openalex-snapshot
Cellular automata with sparse communication
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.10.026openalex-snapshot
Period recovery of strings over the Hamming and edit distances
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00638-2openalex-snapshot
Decomposable multi-parameter matroid optimization problems
inferred← citeshttps://doi.org/10.1093/comjnl/bxm052openalex-snapshot
Width Parameters Beyond Tree-width and their Applications
inferred← citeshttps://doi.org/10.1371/journal.pone.0170907openalex-snapshot
Collective Prediction of Individual Mobility Traces for Users with Short Data History
inferred← citeshttps://doi.org/10.3390/a6030396openalex-snapshot
New Heuristics for Rooted Triplet Consistency
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.