On the public citation graph

LATIN 2004 : theoretical informatics : 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004 : proceedings

0 signed · 90 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/978-1-4612-0539-5openalex-snapshot
Descriptive Complexity
inferredcites →https://doi.org/10.1016/0304-3975(95)00034-topenalex-snapshot
Reachability and the power of local ordering
inferredcites →https://doi.org/10.1016/s0022-0000(74)80046-2openalex-snapshot
An observation on time-storage trade off
inferredcites →https://doi.org/10.1016/s0304-3975(01)00152-9openalex-snapshot
Lower bounds for invariant queries in logics with counting
inferredcites →https://doi.org/10.1093/logcom/4.4.337openalex-snapshot
Logical Description of Monotone NP Problems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11402763_12openalex-snapshot
Computing Equilibria Using Interval Constraints
inferred← citeshttps://doi.org/10.1007/11429647_10openalex-snapshot
Distributed Exploration of an Unknown Graph
inferred← citeshttps://doi.org/10.1007/11429647_20openalex-snapshot
On the Feasibility of Gathering by Autonomous Mobile Robots
inferred← citeshttps://doi.org/10.1007/11523468_51openalex-snapshot
Reordering Buffer Management for Non-uniform Cost Models
inferred← citeshttps://doi.org/10.1007/11533719_14openalex-snapshot
On the Approximation of Computing Evolutionary Trees
inferred← citeshttps://doi.org/10.1007/11533719_27openalex-snapshot
String Coding of Trees with Locality and Heritability
inferred← citeshttps://doi.org/10.1007/11535331_7openalex-snapshot
Density Estimation for Spatial Data Streams
inferred← citeshttps://doi.org/10.1007/11561071_66openalex-snapshot
Finding Frequent Patterns in a String in Sublinear Time
inferred← citeshttps://doi.org/10.1007/11561071_9openalex-snapshot
The Complexity of Games on Highly Regular Graphs
inferred← citeshttps://doi.org/10.1007/11590156_24openalex-snapshot
Practical Algorithms for Tracking Database Join Sizes
inferred← citeshttps://doi.org/10.1007/11602613_37openalex-snapshot
Approximate Colored Range Queries
inferred← citeshttps://doi.org/10.1007/11603771_1openalex-snapshot
Distributed Coordination Algorithms for Mobile Robot Swarms: New Directions and Challenges
inferred← citeshttps://doi.org/10.1007/11604686_7openalex-snapshot
Minimizing NLC-Width is NP-Complete
inferred← citeshttps://doi.org/10.1007/11611257_26openalex-snapshot
Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring
inferred← citeshttps://doi.org/10.1007/11687238_37openalex-snapshot
On Concurrency Control in Sliding Window Queries over Data Streams
inferred← citeshttps://doi.org/10.1007/11687238_5openalex-snapshot
Resource Adaptive Periodicity Estimation of Streaming Data
inferred← citeshttps://doi.org/10.1007/11780823_1openalex-snapshot
Mobile Agent Rendezvous: A Survey
inferred← citeshttps://doi.org/10.1007/11841036_16openalex-snapshot
Estimating Entropy over Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-319-03089-0_21openalex-snapshot
Gathering Asynchronous Oblivious Agents with Restricted Vision in an Infinite Line
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_3openalex-snapshot
Fighting Spam: The Science
inferred← citeshttps://doi.org/10.1007/978-3-540-27796-5_14openalex-snapshot
Existence of Nash Equilibria in Selfish Routing Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-27796-5_15openalex-snapshot
Mobile Agents Rendezvous When Tokens Fail
inferred← citeshttps://doi.org/10.1007/978-3-540-27866-5_108openalex-snapshot
Parallel Delaunay Refinement with Off-Centers
inferred← citeshttps://doi.org/10.1007/978-3-540-30213-1_42openalex-snapshot
Longest Motifs with a Functionally Equivalent Central Block
inferred← citeshttps://doi.org/10.1007/978-3-540-49823-0_34openalex-snapshot
Using Eventually Consistent Compasses to Gather Oblivious Mobile Robots with Limited Visibility
inferred← citeshttps://doi.org/10.1007/978-3-540-69068-9_4openalex-snapshot
Two-Dimensional Pattern Matching with Combined Scaling and Rotation
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_5openalex-snapshot
Distributed Models and Algorithms for Mobile Robot Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_56openalex-snapshot
Improved Online Algorithms for the Sorting Buffer Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-71615-0_2openalex-snapshot
A Hybrid Immune-Based System for the Protein Folding Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_23openalex-snapshot
Generating Minimal k-Vertex Connected Spanning Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-73871-8_17openalex-snapshot
Separator: Sifting Hierarchical Heavy Hitters Accurately from Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_37openalex-snapshot
A Bijective Code for k-Trees with Linear Time Encoding and Decoding
inferred← citeshttps://doi.org/10.1007/978-3-540-74769-7_73openalex-snapshot
A Robust Approach to Find Effective Items in Distributed Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-77444-0_29openalex-snapshot
Mobile Agent Rendezvous in a Ring Using Faulty Tokens
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_52openalex-snapshot
Randomized Rendez-Vous with Limited Memory
inferred← citeshttps://doi.org/10.1007/978-3-540-78849-2_3openalex-snapshot
Aggregate Computation over Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_10openalex-snapshot
Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-89639-5_64openalex-snapshot
Linear Time Constant-Working Space Algorithm for Computing the Genus of a Digital Object
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_29openalex-snapshot
Rendezvous of Mobile Agents When Tokens Fail Anytime
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_13openalex-snapshot
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-04319-2_30openalex-snapshot
Hexagonal Delaunay Triangulation
inferred← citeshttps://doi.org/10.1007/978-3-642-05434-1_23openalex-snapshot
Self-stabilizing Deterministic Gathering
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_16openalex-snapshot
Reconstructing Numbers from Pairwise Function Values
inferred← citeshttps://doi.org/10.1007/978-3-642-13284-1_8openalex-snapshot
Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-13284-1_9openalex-snapshot
Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_41openalex-snapshot
Periodicity in Streams
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-16392-0_3openalex-snapshot
Resource Aware Distributed Knowledge Discovery
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_3openalex-snapshot
Sparse Recovery with Partial Support Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-642-25510-6_29openalex-snapshot
Computing Nash Equilibria of Action-Graph Games via Support Enumeration
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_46openalex-snapshot
Random Walks and Bisections in Random Circulant Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-30191-9_1openalex-snapshot
Trie-based Apriori Motif Discovery Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-33536-5_10openalex-snapshot
Brief Announcement: Mobile Agent Rendezvous on Edge Evolving Rings
inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_4openalex-snapshot
Collecting Information by Power-Aware Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_5openalex-snapshot
Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology
inferred← citeshttps://doi.org/10.1007/978-3-642-35476-2_18openalex-snapshot
Algorithms for Partial Gathering of Mobile Agents in Asynchronous Rings
inferred← citeshttps://doi.org/10.1007/978-3-642-36321-4_15openalex-snapshot
Constraint Driven Stratification of RDF with Hypergraph Graph (HG(2)) Data Structure
inferred← citeshttps://doi.org/10.1007/978-3-642-45278-9_21openalex-snapshot
Protein Folding in 2D-Triangular Lattice Revisited
inferred← citeshttps://doi.org/10.1016/j.aml.2016.06.006openalex-snapshot
On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors
inferred← citeshttps://doi.org/10.1016/j.artint.2019.02.001openalex-snapshot
Rendezvous in planar environments with obstacles and unknown initial distance
inferred← citeshttps://doi.org/10.1016/j.cag.2025.104177openalex-snapshot
Computing skeleton-based handle/tunnel loops
inferred← citeshttps://doi.org/10.1016/j.cam.2012.08.003openalex-snapshot
Multiresolution terrain modeling using level curve information
inferred← citeshttps://doi.org/10.1016/j.dam.2019.03.008openalex-snapshot
Cube-connected circulants: Bisection width, Wiener and forwarding indices
inferred← citeshttps://doi.org/10.1016/j.dam.2019.09.015openalex-snapshot
On the structure of linear programs with overlapping cardinality constraints
inferred← citeshttps://doi.org/10.1016/j.dam.2022.01.002openalex-snapshot
Minimum 2-dominating sets in regular graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.12.011openalex-snapshot
A lower bound on the constant in the Fourier min-entropy/influence conjecture
inferred← citeshttps://doi.org/10.1016/j.future.2021.08.007openalex-snapshot
m-RENDEZVOUS: Multi-Agent Asynchronous Rendezvous Search Technique
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104813openalex-snapshot
Reversible pushdown transducers
inferred← citeshttps://doi.org/10.1016/j.ins.2019.08.045openalex-snapshot
Learned sketches for frequency estimation
inferred← citeshttps://doi.org/10.1016/j.is.2024.102402openalex-snapshot
Learning complex predicates for cardinality estimation using recursive neural networks
inferred← citeshttps://doi.org/10.1016/j.jpaa.2015.09.015openalex-snapshot
On the irreducibility of pseudovarieties of semigroups
inferred← citeshttps://doi.org/10.1016/j.osnem.2025.100315openalex-snapshot
A first principles approach to trust-based recommendation systems in social networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.023openalex-snapshot
Uniform multi-agent deployment on a ring
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.008openalex-snapshot
How to catch L2 -heavy-hitters on sliding windows
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.08.008openalex-snapshot
The κ-word problem over DRH
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.009openalex-snapshot
Gossiping by energy-constrained mobile agents in tree networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.07.027openalex-snapshot
Approximation schemes for subset-sums ratio problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.11.018openalex-snapshot
Gathering problems for autonomous mobile robots with lights
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115390openalex-snapshot
Path connected dynamic graphs with a study of dispersion and exploration
inferred← citeshttps://doi.org/10.1063/1.4934968openalex-snapshot
A highly specific test for periodicity
inferred← citeshttps://doi.org/10.1145/1559845.1559851openalex-snapshot
Secure outsourced aggregation via one-way chains
inferred← citeshttps://doi.org/10.1145/3444815.3444830openalex-snapshot
SIGACT News Online Algorithms Column 36
inferred← citeshttps://doi.org/10.1145/3690624.3709310openalex-snapshot
Weight-Constrained Simple Path Enumeration in Weighted Graph
inferred← citeshttps://doi.org/10.1145/3771091openalex-snapshot
Asynchronous Majority Dynamics on Binomial Random Graphs
inferred← citeshttps://doi.org/10.2200/s00278ed1v01y201004dct001openalex-snapshot
The Mobile Agent Rendezvous Problem in the Ring
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.