On the public citation graph
Mathematical Foundations of Computer Science 1998
0 signed · 75 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/bfb0055770openalex-snapshot
Nonstochastic languages as projections of 2-tape quasideterministic languages
inferredcites →https://doi.org/10.1007/bfb0055772openalex-snapshot
Expressive completeness of Temporal Logic of action
inferredcites →https://doi.org/10.1007/bfb0055775openalex-snapshot
On the word, subsumption, and complement problem for recurrent term schematizations
inferredcites →https://doi.org/10.1007/bfb0055776openalex-snapshot
Encoding the hydra battle as a rewrite system
inferredcites →https://doi.org/10.1007/bfb0055797openalex-snapshot
Positive turing and truth-table completeness for NEXP are incomparable
inferredcites →https://doi.org/10.1007/bfb0055798openalex-snapshot
Tally NP sets and easy census functions
inferredcites →https://doi.org/10.1007/bfb0055799openalex-snapshot
Average-case intractability vs. worst-case intractability
inferredcites →https://doi.org/10.1007/bfb0055806openalex-snapshot
Approximating maximum independent sets in uniform hypergraphs
inferredcites →https://doi.org/10.1007/bfb0055811openalex-snapshot
Speeding-up nondeterministic single-tape off-line computations by one alternation
inferredcites →https://doi.org/10.1007/bfb0055814openalex-snapshot
Blockwise variable orderings for shared BDDs
inferredcites →https://doi.org/10.1007/bfb0055815openalex-snapshot
On the composition problem for OBDDs with multiple variable orders
inferredcites →https://doi.org/10.1007/bfb0055817openalex-snapshot
Minimal forbidden words and factor automata
inferredcites →https://doi.org/10.1007/bfb0055818openalex-snapshot
On defect effect of bi-infinite words
inferredcites →https://doi.org/10.1007/bfb0055821openalex-snapshot
Tree decompositions of small diameter
inferredcites →https://doi.org/10.1007/bfb0055823openalex-snapshot
A parallelization of Dijkstra's shortest path algorithm
inferredcites →https://doi.org/10.1007/bfb0055826openalex-snapshot
One quantifier will do in existential monadic second-order logic over pictures
inferredcites →https://doi.org/10.1007/bfb0055827openalex-snapshot
On some recognizable picture-languages
inferredcites →https://doi.org/10.1007/bfb0055831openalex-snapshot
A finite hierarchy of the recursively enumerable real numbers
inferredcites →https://doi.org/10.1007/bfb0055834openalex-snapshot
Characterization of sensitive linear cellular automata with respect to the counting distance
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2002.2955openalex-snapshot
The Monadic Quantifier Alternation Hierarchy over Grids and Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-16074-5_5openalex-snapshot
A Type System for Access Control Views in Object-Oriented Languages
inferred← citeshttps://doi.org/10.1007/s00165-004-0051-8openalex-snapshot
Modeling layered distributed communication systems
inferred← citeshttps://doi.org/10.1007/s10473-023-0223-3openalex-snapshot
A Rigorous Proof on Circular Wirelength for Hypercubes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2024.102148openalex-snapshot
Parameterized inapproximability of Morse matching
inferred← citeshttps://doi.org/10.1016/j.comnet.2017.07.013openalex-snapshot
EIR: Edge-aware inter-domain routing protocol for the future mobile internet
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.025openalex-snapshot
Colour degree matrices of graphs with at most one cycle
inferred← citeshttps://doi.org/10.1016/j.dam.2017.06.003openalex-snapshot
Half-regular factorizations of the complete bipartite graph
inferred← citeshttps://doi.org/10.1016/j.dam.2020.10.016openalex-snapshot
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
inferred← citeshttps://doi.org/10.1016/j.disopt.2012.11.001openalex-snapshot
A combinatorial algorithm for Horn programs
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.09.004openalex-snapshot
Efficient iterated greedy for the two-dimensional bandwidth minimization problem
inferred← citeshttps://doi.org/10.1016/j.ic.2014.04.001openalex-snapshot
Oblivious two-way finite automata: Decidability and complexity
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104868openalex-snapshot
Usefulness of information and decomposability of unary regular languages
inferred← citeshttps://doi.org/10.1016/j.ijar.2019.05.003openalex-snapshot
A general approach to reasoning with probabilities
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.10.009openalex-snapshot
Automata on linear orderings
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.02.003openalex-snapshot
Insertion operations on deterministic reversal-bounded counter machines
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103603openalex-snapshot
Embedding hypercubes into torus and Cartesian product of paths and/or cycles for minimizing wirelength
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.02.009openalex-snapshot
Some decidability results on one-pass reductions
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100605openalex-snapshot
On the group memory complexity of extended finite automata over groups
inferred← citeshttps://doi.org/10.1016/j.knosys.2020.106651openalex-snapshot
Two-dimensional bandwidth minimization problem: Exact and heuristic approaches
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.10.046openalex-snapshot
The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.039openalex-snapshot
The NP-hardness of finding a directed acyclic graph for regular resolution
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.010openalex-snapshot
Perfectly quilted rectangular snake tilings
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.04.005openalex-snapshot
A Curtis–Hedlund–Lyndon theorem for Besicovitch and Weyl spaces
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.06.040openalex-snapshot
A Mezei–Wright theorem for categorical algebras
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.08.024openalex-snapshot
Complexity of multi-head finite automata: Origins and directions
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.024openalex-snapshot
Bulking II: Classifications of cellular automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.003openalex-snapshot
Digraph decompositions and monotonicity in digraph searching
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.05.007openalex-snapshot
A linear time algorithm for embedding hypercube into cylinder and torus
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.02.034openalex-snapshot
The effect of end-markers on counter machines and commutativity
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.05.020openalex-snapshot
Optimal Embedding of Hypercube into Cylinder
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00046-4openalex-snapshot
An algebraic model of observable properties in distributed systems
inferred← citeshttps://doi.org/10.1038/s41598-025-98962-5openalex-snapshot
On the optimal layout of (Kp − Cp)n into grid and certain structures
inferred← citeshttps://doi.org/10.1080/03081080500094048openalex-snapshot
Possible numbers of ones in 0–1 matrices with a given rank
inferred← citeshttps://doi.org/10.1109/ialp57159.2022.9961280openalex-snapshot
Petroleum Exploration and Development Text Triplet Extraction Based on Deep Learning
inferred← citeshttps://doi.org/10.1109/iccece58074.2023.10135486openalex-snapshot
Parallel hypernym relation extraction based on partition index dividing
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00012openalex-snapshot
Bootstrapping Information Extraction via Conceptualization
inferred← citeshttps://doi.org/10.1109/iceiec49280.2020.9152287openalex-snapshot
Noise Reduction Framework for Distantly Supervised Relation Extraction with Human in the Loop
inferred← citeshttps://doi.org/10.1109/icsec.2015.7401451openalex-snapshot
Mining associative and comparative patterns for Thai sentiment analysis
inferred← citeshttps://doi.org/10.1109/wi-iat.2009.336openalex-snapshot
Constructing Event Templates from Written News
inferred← citeshttps://doi.org/10.1145/2803172openalex-snapshot
Tilewise Accumulated Cost Surface Computation with Graphics Processing Units
inferred← citeshttps://doi.org/10.1145/317636.317775openalex-snapshot
When is a functional program not a functional program?
inferred← citeshttps://doi.org/10.1145/317765.317775openalex-snapshot
When is a functional program not a functional program?
inferred← citeshttps://doi.org/10.1145/3620665.3640408openalex-snapshot
Lightweight Fault Isolation: Practical, Efficient, and Secure Software Sandboxing
inferred← citeshttps://doi.org/10.1145/3632890openalex-snapshot
When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism
inferred← citeshttps://doi.org/10.1145/3704907openalex-snapshot
Bidirectional Higher-Rank Polymorphism with Intersection and Union Types
inferred← citeshttps://doi.org/10.1287/trsc.2021.1113openalex-snapshot
Hyperbush Algorithm for Strategy-Based Equilibrium Traffic Assignment Problems
inferred← citeshttps://doi.org/10.23919/ccc55666.2022.9901677openalex-snapshot
A review of the knowledge extraction technology in knowledge graph
inferred← citeshttps://doi.org/10.4169/mathhorizons.19.3.22openalex-snapshot
An Algebraic Approach to Geometrical Optimization
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.