On the public citation graph
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
0 signed · 45 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.1006/inco.1994.1098openalex-snapshot
The Complexity of Word Problems - This Time with Interleaving
inferredcites →https://doi.org/10.1006/inco.1997.2695openalex-snapshot
One-Unambiguous Regular Languages
inferredcites →https://doi.org/10.1016/0020-0190(94)00130-8openalex-snapshot
Haskell overloading is DEXPTIME-complete
inferredcites →https://doi.org/10.1016/j.ic.2006.12.003openalex-snapshot
One-unambiguity of regular expressions with numeric occurrence indicators
inferredcites →https://doi.org/10.1016/j.jcss.2006.10.005openalex-snapshot
Frontiers of tractability for typechecking simple XML transformations
inferredcites →https://doi.org/10.1016/j.jcss.2006.10.021openalex-snapshot
On the minimization of XML Schemas and tree automata for unranked trees
inferredcites →https://doi.org/10.1016/s0304-3975(99)00109-7openalex-snapshot
Shuffle languages are in P
inferredcites →https://doi.org/10.1137/0219027openalex-snapshot
Deciding Equivalence of Finite Tree Automata
inferredcites →https://doi.org/10.1145/1111627.1111631openalex-snapshot
Taxonomy of XML schema languages using formal language theory
inferredcites →https://doi.org/10.1145/1166074.1166076openalex-snapshot
Expressiveness and complexity of XML Schema
inferredcites →https://doi.org/10.1145/1346330.1346333openalex-snapshot
XPath satisfiability in the presence of DTDs
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-030-75765-6_25openalex-snapshot
Learning Finite Automata with Shuffle
inferred← citeshttps://doi.org/10.1007/978-3-031-00123-9_41openalex-snapshot
Membership Algorithm for Single-Occurrence Regular Expressions with Shuffle and Counting
inferred← citeshttps://doi.org/10.1007/978-3-032-31176-4_7openalex-snapshot
Decomposing Regular Languages Under Shuffle Along Trajectories
inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_24openalex-snapshot
Simplifying Regular Expressions
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_10openalex-snapshot
Recognizing Shuffled Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_27openalex-snapshot
The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_19openalex-snapshot
Deciding Definability by Deterministic Regular Expressions
inferred← citeshttps://doi.org/10.1007/978-3-642-38771-5_8openalex-snapshot
Cuts in Regular Expressions
inferred← citeshttps://doi.org/10.1007/978-981-96-0602-3_19openalex-snapshot
A Derivative-Based Membership Algorithm for Enhanced Regular Expressions
inferred← citeshttps://doi.org/10.1007/s00224-014-9593-1openalex-snapshot
Schemas for Unordered XML on a DIME
inferred← citeshttps://doi.org/10.1016/j.ic.2017.09.002openalex-snapshot
On the complexity and decidability of some problems involving shuffle
inferred← citeshttps://doi.org/10.1016/j.is.2008.10.001openalex-snapshot
Efficient inclusion for a class of XML types with interleaving and counting
inferred← citeshttps://doi.org/10.1016/j.is.2010.10.001openalex-snapshot
Checking determinism of XML Schema content models in optimal time
inferred← citeshttps://doi.org/10.1016/j.scico.2020.102436openalex-snapshot
Inclusion algorithms for one-unambiguous regular expressions and their applications
inferred← citeshttps://doi.org/10.1016/j.sysarc.2026.103759openalex-snapshot
Derivative-based algorithms for membership, k -non-emptiness, and k -non-empty complement problems in enhanced regular expressions
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.04.022openalex-snapshot
Shuffled languages—Representation and recognition
inferred← citeshttps://doi.org/10.1137/080743457openalex-snapshot
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
inferred← citeshttps://doi.org/10.1137/100814196openalex-snapshot
Regular Expressions with Counting: Weak versus Strong Determinism
inferred← citeshttps://doi.org/10.1145/1645953.1645973openalex-snapshot
Linear inclusion for XML regular expression types
inferred← citeshttps://doi.org/10.1145/2071368.2071372openalex-snapshot
Succinctness of the Complement and Intersection of Regular Expressions
inferred← citeshttps://doi.org/10.1145/2213556.2213573openalex-snapshot
The complexity of evaluating path expressions in SPARQL
inferred← citeshttps://doi.org/10.1145/2213598.2213609openalex-snapshot
Foundations of regular expressions in XML schema languages and SPARQL
inferred← citeshttps://doi.org/10.1145/2494529openalex-snapshot
The complexity of regular expressions and property paths in SPARQL
inferred← citeshttps://doi.org/10.1145/2806416.2806434openalex-snapshot
Efficient Incremental Evaluation of Succinct Regular Expressions
inferred← citeshttps://doi.org/10.1145/3132701openalex-snapshot
Linear Time Membership in a Class of Regular Expressions with Counting, Interleaving, and Unordered Concatenation
inferred← citeshttps://doi.org/10.1145/3294052.3319687openalex-snapshot
Containment of Shape Expression Schemas for RDF
inferred← citeshttps://doi.org/10.4242/balisagevol5.stuhrenberg01openalex-snapshot
Refining the Taxonomy of XML Schema Languages. A new Approach for Categorizing XML Schema Languages in Terms of Processing Complexity.
inferred← citeshttps://doi.org/10.48550/arxiv.1005.5623openalex-snapshot
A Tree Logic with Graded Paths and Nominals
inferred← citeshttps://doi.org/10.48550/arxiv.1303.4277openalex-snapshot
Simple Schemas for Unordered XML
inferred← citeshttps://doi.org/10.70675/0403fec7z6d88z4f5czb5d8z53294519fb37openalex-snapshot
Automated reasoning on trees with cardinality constraints
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.