On the public citation graph

Bicontinuous extensions of invertible combinatorial functions

0 signed · 106 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/3-540-10003-2_104openalex-snapshot

Reversible Computing

inferredcites →https://doi.org/10.1016/s0019-9958(76)90390-9openalex-snapshot

Feedback and generalized logic

inferredcites →https://doi.org/10.1016/s0022-0000(77)80007-xopenalex-snapshot

Computation and construction universality of reversible cellular automata

inferredcites →https://doi.org/10.1080/01969727608927527openalex-snapshot

ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION

inferredcites →https://doi.org/10.1147/rd.176.0525openalex-snapshot

Logical Reversibility of Computation

inferredcites →https://doi.org/10.1147/rd.441.0261openalex-snapshot

Irreversibility and heat generation in the computing process

inferredcites →https://doi.org/10.1147/rd.53.0183openalex-snapshot

Irreversibility and Heat Generation in the Computing Process

What points at this work

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

inferred← citeshttps://doi.org/10.1002/qua.22056openalex-snapshot

Quantum computing measurement and intelligence

inferred← citeshttps://doi.org/10.1007/10722298_6openalex-snapshot

A Reversible SE(M)CD Machine

inferred← citeshttps://doi.org/10.1007/11750321_35openalex-snapshot

Group Theory Based Synthesis of Binary Reversible Circuits

inferred← citeshttps://doi.org/10.1007/3-540-10003-2_104openalex-snapshot

Reversible Computing

inferred← citeshttps://doi.org/10.1007/3-540-45338-5_10openalex-snapshot

Basic Concepts in Quantum Computation

inferred← citeshttps://doi.org/10.1007/3-540-45933-2_3openalex-snapshot

Introduction to Quantum Computation

inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_456openalex-snapshot

Reversible Computing

inferred← citeshttps://doi.org/10.1007/978-0-387-49820-1_8openalex-snapshot

Physics, Information, and Computation

inferred← citeshttps://doi.org/10.1007/978-1-4471-0129-1_3openalex-snapshot

Conservative Logic

inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_165openalex-snapshot

Reversible Computing

inferred← citeshttps://doi.org/10.1007/978-1-4757-2606-0_8openalex-snapshot

Physics, Information, and Computation

inferred← citeshttps://doi.org/10.1007/978-1-4939-6883-1_456openalex-snapshot

Reversible Computing

inferred← citeshttps://doi.org/10.1007/978-3-031-02516-7openalex-snapshot

High Level Structures for Quantum Computing

inferred← citeshttps://doi.org/10.1007/978-3-319-08123-6_23openalex-snapshot

Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements

inferred← citeshttps://doi.org/10.1007/978-3-319-09039-9_6openalex-snapshot

Constructing Reversible Turing Machines by Reversible Logic Element with Memory

inferred← citeshttps://doi.org/10.1007/978-3-319-13350-8_26openalex-snapshot

How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory?

inferred← citeshttps://doi.org/10.1007/978-3-319-42261-9_4openalex-snapshot

Application of Isotopic Materials Science in Bulk and Low-Dimensional Structures

inferred← citeshttps://doi.org/10.1007/978-3-540-31834-7_20openalex-snapshot

Classification and Universality of Reversible Logic Elements with One-Bit Memory

inferred← citeshttps://doi.org/10.1007/978-3-540-74593-8_8openalex-snapshot

A Universal Reversible Turing Machine

inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_456-3openalex-snapshot

Reversible Computing

inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_456-4openalex-snapshot

Reversible Computing

inferred← citeshttps://doi.org/10.1007/978-3-642-28750-3_4openalex-snapshot

Concepts of Quantum Computers

inferred← citeshttps://doi.org/10.1007/978-3-642-33137-4_19openalex-snapshot

Artificial Molecular Nanomagnets as Spin-Based Quantum Logic Gates

inferred← citeshttps://doi.org/10.1007/978-4-431-53868-4_29openalex-snapshot

Universality of 2-State 3-Symbol Reversible Logic Elements — A Direct Simulation Method of a Rotary Element

inferred← citeshttps://doi.org/10.1007/978-94-009-0313-5_51openalex-snapshot

Limits of Quantum Computing: Analysis of a Concrete Algorithm

inferred← citeshttps://doi.org/10.1007/978-94-010-0155-7_21openalex-snapshot

Quantum Computing: A Way to Break Complexity?

inferred← citeshttps://doi.org/10.1007/bf01126213openalex-snapshot

Organization of computations on the atomic-molecular level

inferred← citeshttps://doi.org/10.1007/bf01201813openalex-snapshot

Representation of Reversible Cellular Automata with Block Permutations

inferred← citeshttps://doi.org/10.1007/bf01857727openalex-snapshot

Conservative logic

inferred← citeshttps://doi.org/10.1007/bf01857734openalex-snapshot

Physics of selective systems: Computation and biology

inferred← citeshttps://doi.org/10.1007/bf01886518openalex-snapshot

Quantum mechanical computers

inferred← citeshttps://doi.org/10.1007/bf02084158openalex-snapshot

The thermodynamics of computation—a review

inferred← citeshttps://doi.org/10.1007/bfb0017210openalex-snapshot

NREVERSAL of fortune — The thermodynamics of garbage collection

inferred← citeshttps://doi.org/10.1007/s00224-004-1166-2openalex-snapshot

Algebraic Characterization of Reversible Logic Gates

inferred← citeshttps://doi.org/10.1007/s00601-022-01749-xopenalex-snapshot

Nuclear Forces for Precision Nuclear Physics: A Collection of Perspectives

inferred← citeshttps://doi.org/10.1007/s10867-006-9025-9openalex-snapshot

Quantum Information Processing in the Wall of Cytoskeletal Microtubules

inferred← citeshttps://doi.org/10.1007/s11433-011-4460-4openalex-snapshot

Universal quantum circuit of near-trivial transformations

inferred← citeshttps://doi.org/10.1016/0030-4018(87)90163-5openalex-snapshot

Reversible computing: All-optical implementation of interaction and priese gates

inferred← citeshttps://doi.org/10.1016/0167-2789(84)90255-0openalex-snapshot

Modelling cellular automata with partial differential equations

inferred← citeshttps://doi.org/10.1016/0167-2789(90)90185-ropenalex-snapshot

Invertible cellular automata: A review

inferred← citeshttps://doi.org/10.1016/0375-9601(94)90537-1openalex-snapshot

Quantum computer on a class of one-dimensional Ising systems

inferred← citeshttps://doi.org/10.1016/b978-0-12-809381-8.16001-8openalex-snapshot

References

inferred← citeshttps://doi.org/10.1016/j.camwa.2007.11.040openalex-snapshot

Minimal universal library for n×n reversible circuits

inferred← citeshttps://doi.org/10.1016/j.entcs.2010.02.004openalex-snapshot

Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract)

inferred← citeshttps://doi.org/10.1016/j.nimb.2017.05.063openalex-snapshot

Lifetime quenching due to surface wake field

inferred← citeshttps://doi.org/10.1016/j.pmatsci.2005.08.002openalex-snapshot

Fundamentals and applications of isotope effect in solids

inferred← citeshttps://doi.org/10.1016/j.proeng.2014.03.148openalex-snapshot

Operations on Quantum Physical Artificial Neural Structures

inferred← citeshttps://doi.org/10.1016/j.tcs.2004.06.012openalex-snapshot

How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.041openalex-snapshot

Reversible computing and cellular automata—A survey

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.031openalex-snapshot

Realization and synthesis of reversible functions

inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70025-9openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/s0079-6727(98)00004-4openalex-snapshot

Basics of quantum computation

inferred← citeshttps://doi.org/10.1016/s0167-2789(98)00040-2openalex-snapshot

Quo vadimus? — Much hard work is still needed

inferred← citeshttps://doi.org/10.1016/s0167-2789(98)00044-xopenalex-snapshot

Quantum computation based on retarded and advanced propagation

inferred← citeshttps://doi.org/10.1080/0020716042000301815openalex-snapshot

On synthesis of 3 × 3 reversible logic functions

inferred← citeshttps://doi.org/10.1080/03081070008960928openalex-snapshot

A DATA MODEL FOR THE MORPHOGENETIC NEURON

inferred← citeshttps://doi.org/10.1088/0034-4885/76/7/076001openalex-snapshot

Quantum error correction for beginners

inferred← citeshttps://doi.org/10.1088/0305-4470/28/19/016openalex-snapshot

On the symmetry of logic

inferred← citeshttps://doi.org/10.1088/0305-4470/35/33/307openalex-snapshot

Generating the group of reversible logic gates

inferred← citeshttps://doi.org/10.1088/0305-4470/38/44/006openalex-snapshot

Realizing ternary quantum switching networks without ancilla bits

inferred← citeshttps://doi.org/10.1088/0305-4470/39/24/013openalex-snapshot

Universality of 2-qudit ternary reversible gates

inferred← citeshttps://doi.org/10.1088/1367-2630/ace077openalex-snapshot

Exploring ab initio machine synthesis of quantum circuits

inferred← citeshttps://doi.org/10.1098/rspa.1989.0099openalex-snapshot

Quantum computational networks

inferred← citeshttps://doi.org/10.1098/rspa.1995.0066openalex-snapshot

A universal two-bit gate for quantum computation

inferred← citeshttps://doi.org/10.1098/rsta.2001.0936openalex-snapshot

Quantum computing classical physics

inferred← citeshttps://doi.org/10.1103/physreva.109.053527openalex-snapshot

Single-layer universal optical computing

inferred← citeshttps://doi.org/10.1103/physreva.52.3554openalex-snapshot

Simple cavity-QED two-bit universal quantum logic gate: The principle and expected performances

inferred← citeshttps://doi.org/10.1103/physreva.54.147openalex-snapshot

Quantum networks for elementary arithmetic operations

inferred← citeshttps://doi.org/10.1103/physreva.64.012308openalex-snapshot

Nonholonomic quantum devices

inferred← citeshttps://doi.org/10.1103/physreva.75.012322openalex-snapshot

Shortest paths for efficient control of indirectly coupled qubits

inferred← citeshttps://doi.org/10.1103/physreva.99.022311openalex-snapshot

Proof of efficient, parallelized, universal adiabatic quantum computation

inferred← citeshttps://doi.org/10.1103/physrevlett.53.1204openalex-snapshot

Commnet on "Dissipation in Computation"

inferred← citeshttps://doi.org/10.1103/physrevlett.74.4087openalex-snapshot

Realizable Universal Quantum Logic Gates

inferred← citeshttps://doi.org/10.1103/physrevlett.74.5024openalex-snapshot

Entrainment and Communication with Dissipative Pseudorandom Dynamics

inferred← citeshttps://doi.org/10.1103/physrevlett.77.4683openalex-snapshot

Quantum Logical Operations on Encoded Qubits

inferred← citeshttps://doi.org/10.1103/physrevresearch.6.013308openalex-snapshot

Full-magnetic implementation of a classical Toffoli gate

inferred← citeshttps://doi.org/10.1103/revmodphys.74.197openalex-snapshot

The role of relative entropy in quantum information theory

inferred← citeshttps://doi.org/10.1103/revmodphys.74.347openalex-snapshot

Information and computation: Classical and quantum aspects

inferred← citeshttps://doi.org/10.1109/cdc.2009.5400413openalex-snapshot

The standard parts problem and the complexity of control communication

inferred← citeshttps://doi.org/10.1109/cec.2006.1688608openalex-snapshot

A Constructive Algorithm for Reversible Logic Synthesis

inferred← citeshttps://doi.org/10.1109/cec.2010.5586366openalex-snapshot

Synthesizing hybrid quantum circuits without ancilla qudits

inferred← citeshttps://doi.org/10.1109/fuzzy.1998.687584openalex-snapshot

Fuzzy reversible logic

inferred← citeshttps://doi.org/10.1109/icnc.2012.10openalex-snapshot

Reversible Computing Systems, Logic Circuits, and Cellular Automata

inferred← citeshttps://doi.org/10.1109/ispacs.2010.5704651openalex-snapshot

Realization and synthesis of reversible functions throng double-coset

inferred← citeshttps://doi.org/10.1109/scm.2016.7519785openalex-snapshot

Complexity of representations of multiple-output Boolean functions in the reversible logic circuits

inferred← citeshttps://doi.org/10.1109/sfcs.1993.366852openalex-snapshot

Quantum circuit complexity

inferred← citeshttps://doi.org/10.1137/s0097539796300921openalex-snapshot

Quantum Complexity Theory

inferred← citeshttps://doi.org/10.1142/s0217751x0100492xopenalex-snapshot

WHAT IS QUANTUM COMPUTATION?

inferred← citeshttps://doi.org/10.1145/167088.167097openalex-snapshot

Quantum complexity theory

inferred← citeshttps://doi.org/10.1145/3772318.3790264openalex-snapshot

How Notations Evolve: A Historical Analysis with Implications for Supporting User-Defined Abstractions

inferred← citeshttps://doi.org/10.1364/josab.31.000400openalex-snapshot

Implementation of distributed Toffoli gates in separate cavities through virtual excitation processes

inferred← citeshttps://doi.org/10.2200/s00422ed1v01y201205qmc006openalex-snapshot

High-level Structures for Quantum Computing

inferred← citeshttps://doi.org/10.2478/v10175-011-0039-5openalex-snapshot

Models of quantum computation and quantum programming languages

inferred← citeshttps://doi.org/10.4204/eptcs.128.3openalex-snapshot

Reversible Logic Elements with Memory and Their Universality

inferred← citeshttps://doi.org/10.4310/cis.2009.v9.n1.a5openalex-snapshot

Control Communication Complexity of Nonlinear Systems

inferred← citeshttps://doi.org/10.48550/arxiv.1304.5916openalex-snapshot

A complete transformation rule set and a minimal equation set for CNOT-based 3-qubit quantum circuits (Draft)

inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/9804039openalex-snapshot

A Parallel Quantum Computer Simulator

inferred← citeshttps://doi.org/10.7498/aps.64.240301openalex-snapshot

Quantum walk search algorithm based on phase matching and circuit cmplementation

inferred← citeshttps://doi.org/10.82308/31455openalex-snapshot

Applications of algebraic automata theory to quantum finite automata

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.