yusuke1997/dblp-id-title huggingface dataset:
RefineHD: Accurate and Efficient Single-Pass Adaptive Learning Using Hyperdimensional Computing
Rebooting Neuromorphic Design - A Complexity Engineering Approach
Reversible Computing as a Path Towards Unbounded Energy Efficiency: Challenges and Opportunities Invited Talk
On a Learning Method of the SIC Fuzzy Inference Model with Consequent Fuzzy Sets
Evaluation of Ferroelectric Devices for Neuromorphic Applications
Information processing with large-scale optical integrated circuits
Feature Learning Using Synaptic Competition in a Dynamically-Sized Neuromorphic Architecture
Understanding Quantum Control Processor Capabilities and Limitations through Circuit Characterization
COMPASS: Compiler Pass Selection For Improving Fidelity Of NISQ Applications
Thermodynamic Bayesian Inference
Approximate computing: Challenges and opportunities
Hardware Trojan Detection in Implantable Medical Devices Using Adiabatic Computing
An n-Bit Adder Realized via Coherent Optical Parallel Computing
Compressed vector-matrix multiplication for Memristor-based ensemble neural networks
Gradient matching of higher order combinatorial optimization in quadratic Ising machines
An Efficient Reversible Algorithm for Linear Regression
Securing Data Centers, Handheld Computers, and Networked Sensors against Viruses and Rootkits
Design Considerations for 3D Heterogeneous Integration Driven Analog Processing-in-Pixel for Extreme-Edge Intelligence
Energy Efficiency of Microring Resonator (MRR)-Based Binary Decision Diagram (BDD) Circuits
Deep Mapper: A Multi-Channel Single-Cycle Near-Sensor DNN Accelerator
Computing in the Cambrian Era Plenary Talk
Resistive Coupled VO2 Oscillators for Image Recognition
A Spike-Timing Neuromorphic Architecture
Electric-Field Bit Write-In for Molecular Quantum-Dot Cellular Automata Circuits
Improved Deep Neural Network Hardware-Accelerators Based on Non-Volatile-Memory: The Local Gains Technique
VoiceHD: Hyperdimensional Computing for Efficient Speech Recognition
Design of Computing Circuits using Spatially Localized DNA Majority Logic Gates
Hybrid Cryogenic Memory Cells for Superconducting Computing Applications
Neuromorphic computing with integrated photonics and superconductors
International Conference on Rebooting Computing, ICRC 2020, Atlanta, GA, USA, December 1-3, 2020
IEEE International Conference on Rebooting Computing, ICRC 2016, San Diego, CA, USA, October 17-19, 2016
Virtualizing Analog Mesh Computers: The Case of a Photonic PDE Solving Accelerator
Design of a 16-Bit Adiabatic Microprocessor
StoX-Net: Stochastic Processing of Partial Sums for Efficient In-Memory Computing DNN Accelerators
On the Limits of Stochastic Computing
Virtual Neuron: A Neuromorphic Approach for Encoding Numbers
2018 IEEE International Conference on Rebooting Computing, ICRC 2018, McLean, VA, USA, November 7-9, 2018
Optimized Quantum Program Execution Ordering to Mitigate Errors in Simulations of Quantum Systems
Scalable Spintronic Synapses for Analog In-Memory Computing Based on Exchange-Coupled Nanostructures
Optically-inspired computing based on spin waves
Neural Network Enhanced Robustness for Noisy Quantum Applications
A Thermodynamic Treatment of Intelligent Systems
Regular Expression Matching with Memristor TCAMs
Hyperdimensional Computing Provides Computational Paradigms for Oscillatory Systems
Integrated Photonics Architectures for Residue Number System Computations
Statistical Characterization of ReRAM Arrays for Analog In-Memory Computing
Low-Power and Secure Lightweight Cryptography Via TFET-Based Energy Recovery Circuits
Entangled State Preparation for Non-Binary Quantum Computing
Spiking Neural Streaming Binary Arithmetic
Accelerating PDEs with Chiplet-Based Processing Chains
Achieving Swarm Intelligence with Spiking Neural Oscillators
Magneto-Electric Approximate Computational Circuits for Bayesian Inference
A path toward ultra-low-energy computing
XtokaxtikoX: A stochastic computing-based autonomous cyber-physical system
Hardware-Software Co-Design for an Analog-Digital Accelerator for Machine Learning
Accelerating PageRank Algorithmic Tasks with a new Programmable Hardware Architecture
Neural Network Activation Functions with Electro-Optic Absorption Modulators
Designing Crosstalk Circuits at 7nm
Fast Solution of Linear Systems with Analog Resistive Switching Memory (RRAM)
ATHENA: Enabling Codesign for Next-Generation AI/ML Architectures
Parallel Quantum Computing Emulation
2019 IEEE International Conference on Rebooting Computing, ICRC 2019, San Mateo, CA, USA, November 6-8, 2019
A Configurable CPG Controller using Connectome based SNN on FPGA for Robot Locomotion
Architectural Considerations for Scalable Analog Ising Machines
Testing the Accuracy of Surface Code Decoders
Spiking network algorithms for scientific computing
An Improved Implementation Approach for Quantum Phase Estimation on Quantum Computers
Mitigating the Correlation Problem in Multi-Layer Stochastic Circuits
Towards Higher Scalability of Quantum Hardware Emulation Using Efficient Resource Scheduling
TCAmM CogniGron : Energy Efficient Memristor-Based TCAM for Match-Action Processing
Optimal Clifford Initial States for Ising Hamiltonians
An Efficient Adder Architecture with Three- Independent-Gate Field-Effect Transistors
High-Level Synthesis of Non-Rectangular Multi-Dimensional Nested Loops Using Reshaping and Vectorization
Still a Fight to Get It Right: Verification in the Era of Machine Learning
Bayesian sensor fusion with fast and low power stochastic circuits
Adiabatic Flip-Flop and SRAM Design for an Adiabatic Reversible Microprocessor
A Comparison between Single Purpose and Flexible Neuromorphic Processor Designs
Mixed Delay/Nondelay Embeddings Based Neuromorphic Computing with Patterned Nanomagnet Arrays
Performance comparison of memristor crossbar-based analog and FPGA-based digital weight-memory-less neural networks
An efficient algebraic representation for graph states for measurement-based quantum computing
Thermodynamic Algorithms for Quadratic Programming
Optical implementation of probabilistic graphical models
A functional architecture for scalable quantum computing
Radiographic Inference Based on a Model of V1 Simple Cells Implemented on the D-Wave 2X Quantum Annealing Computer
Quantum Array Multiplier
Training Deep Neural Networks with Constrained Learning Parameters
Tucker-1 Boolean Tensor Factorization with Quantum Annealers
Asynchronous Ballistic Reversible Computing
An Integrated Optical Parallel Multiplier Exploiting Approximate Binary Logarithms Towards Light Speed Data Processing
AutoML for neuromorphic computing and application-driven co-design: asynchronous, massively parallel optimization of spiking architectures
Digital Annealing Route to Complex Magnetic Phase Discovery
SC-SD: Towards Low Power Stochastic Computing Using Sigma Delta Streams
A New Concept for Computing Using Interconnect Crosstalks
Reducing Binary Quadratic Forms for More Scalable Quantum Annealing
Encoding Numbers with Graded Spikes
Neural processor design enabled by memristor technology
An Energy-Efficient Reconfigurable Nanophotonic Computing Architecture Design: Optical Lookup Table
Neuromorphic Computation Using Quantum-Dot Cellular Automata
Superconnectors: A Latency Insensitive Approach to SFQ Design
Exploring Spiking Neural Networks in Single and Multi-agent RL Methods
A Reconfigurable Field-Coupled Nanocomputing Paradigm on Uniform Molecular Monolayers
Computing with dynamical systems
A New Approach for Multi-Valued Computing Using Machine Learning
Neuromorphic Computing with Signal-Mixing Cavities
Energy efficiency limits of logic and memory
Design of General Purpose Minimal-Auxiliary Ising Machines
Design of Superconducting Optoelectronic Networks for Neuromorphic Computing
A recurrent crossbar of memristive nanodevices implements online novelty detection
Experimental Insights from the Rogues Gallery
Accelerating Discrete Fourier Transforms with dot-product engine
IEEE International Conference on Rebooting Computing, ICRC 2017, Washington, DC, USA, November 8-9, 2017
Cost Explosion for Efficient Reinforcement Learning Optimisation of Quantum Circuits
Enabling a Programming Environment for an Experimental Ion Trap Quantum Testbed
Multi-Level Optimization for Large Fan-In Optical Logic Circuits Using Integrated Nanophotonics
Demonstrating Quantum Advantage in Hybrid Quantum Neural Networks for Model Capacity
DRC 2 : Dynamically Reconfigurable Computing Circuit based on memory architecture
Impact of Linearity and Write Noise of Analog Resistive Memory Devices in a Neural Algorithm Accelerator
Convolutional Drift Networks for Video Classification
Computing Based on Material Training: Application to Binary Classification Problems
Erasing logic-memory boundaries in superconductor electronics
Hyperdimensional biosignal processing: A case study for EMG-based hand gesture recognition
Optimizing the Spin Reversal Transform on the D-Wave 2000Q
BuzzSort: A Linear-Time, Event-Driven Data Conversion and Sorting Framework for Approximate Computing Architectures
Accelerating VQE Algorithm via Parameters and Measurement Reuse
Architecture and Dissipation: Thermodynamic Costs of General Purposeness in von Neumann Processors
Generalize or Die: Operating Systems Support for Memristor-Based Accelerators
Neuromorphic Adaptive Edge-Preserving Denoising Filter
A Case for Noisy Shallow Gate-based Circuits in Quantum Machine Learning
Double barrier memristive devices for neuromorphic computing
Structure Discovery for Gene Expression Networks with Emerging Stochastic Hardware
CMOS Based Scalable Cryogenic Control Electronics for Qubits
Energy-Efficient Single-Flux-Quantum Based Neuromorphic Computing
Synchronised 4-Phase Resonant Power Clock Supply for Energy Efficient Adiabatic Logic
Probabilistic Neural Circuits leveraging AI-Enhanced Codesign for Random Number Generation
Exploration of the viability of TiN/TiOX ReRAM in Computational Random-Access Memory (CRAM)
Accelerating machine learning with Non-Volatile Memory: Exploring device and circuit tradeoffs
Towards Logic-In-Memory circuits using 3D-integrated Nanomagnetic logic
Basic Operations And Structure Of An FPGA Accelerator For Parallel Bit Pattern Computation
Analog Neural Network Inference Accuracy in One-Selector One-Resistor Memory Arrays
Reducing Read Amplification and Re-synthesis in DNA-based Archival Storage
Dendrite-inspired Computing to Improve Resilience of Neural Networks to Faults in Emerging Memory Technologies
Ballistic Asynchronous Reversible Computing in Superconducting Circuits
Non-Volatile Memory Array Based Quantization- and Noise-Resilient LSTM Neural Networks
Physical Constraints on Quantum Circuits
A Unified Hardware/Software Co-Design Framework for Neuromorphic Computing Devices and Applications
Embedding in Neural Networks: A-Priori Design of Hybrid Computers for Prediction
Multi-Level Optical Weights in Integrated Circuits
Auditory Neural Pathway Simulation
PRACO: A Photonic Residue-Number Architecture for Collective Operations
An Ising Computer Based on Simulated Quantum Annealing by Path Integral Monte Carlo Method
Molecular cellular networks: A non von Neumann architecture for molecular electronics
PimCity: A Compute in Memory Substrate featuring both Row and Column Parallel Computing
Quantum Accelerators for High-Performance Computing Systems
Deep Learning Cookbook: Recipes for your AI Infrastructure and Applications
Demonstration of a Coherent Tunable Amplifier for All-Optical Ising Machines
A Memcomputing Approach to Prime Factorization
Conversion of artificial recurrent neural networks to spiking neural networks for low-power neuromorphic hardware
Solving Quadratic Unconstrained Binary Optimization with Collaborative Spiking Neural Networks
Conscious Machines for Autonomous Agents and Cybersecurity
A Comparator Design Targeted towards Neural Nets
Parallel Composition of Finite State Activity Automata
Minicomplexity
Descriptional Complexity of Rewriting Tissue P Systems
Comparisons between Measures of Nondeterminism on Finite Automata
Two-Way Automata over Locally Finite Semirings
Descriptional Complexity of Cellular Automata and Decidability Questions
Low-Complexity Tilings of the Plane
Positive Valence Grammars
Millstream Systems and Graph Transformation for Complex Linguistic Models - (Extended Abstract)
Ranking Binary Unlabelled Necklaces in Polynomial Time
Partial Derivative Automaton by Compressing Regular Expressions
6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26 - 28, 2004. Pre-proceedings
Descriptional Complexity of NFAs of Different Ambiguity
Computation Width and Deviation Number
Refining Nondeterminism below Linear-Time
Regular Realizability Problems and Context-Free Languages
State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet
Site-Directed Insertion: Decision Problems, Maximality and Minimality
On the Number of Conditional Productions in Simple Semi-conditional Grammars
Remarks on Context-Free Parallel Communicating Grammar Systems Generating Crossed Agreements
One-Time Nondeterministic Computations
Computability on Quasi-Polish Spaces
Descriptional Complexity of Pushdown Store Languages
On the Degree Complexity of Special Non-Context-Free Languages with Respect to PC Grammar Systems
On the Number of Nonterminals in Linear Conjunctive Grammars
Yet Another Canonical Nondeterministic Automaton
State Complexity of Binary Coded Regular Languages
State Grammars with Stores
Probabilistic Parsing Strategies
On the Degree of Team Cooperation in CD Grammar Systems
Bounded Counter Languages
The Emptiness Problem for Weak Rabin Tree Automata
Complexity of Checking Whether Two Automata Are Synchronized by the Same Language
Matrix Forbidding Grammars
State Complexity of Orthogonal Catenation
Automata-like Membrane Systems - A Natural Way to Describe Complex Phenomena
Multidimensional Descriptional Complexity of P Systems
A Parametrized Analysis of Algorithms on Hierarchical Graphs
Descriptional Complexity of Splicing Systems
Completely Reachable Automata
Sensing as a Complexity Measure
Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors
Complexity, Information, Energy
Complexity Issues for the Iterated h-Preorders
Transition Function Complexity of Finite Automata
Restricted sets of trajectories and decidability of shuffle decompositions
Descriptional Complexity Issues in Membrane Computing
Recent Developments in Quantum Algorithms and Complexity
State Complexity of Single-Word Pattern Matching in Regular Languages
A S 2 P ÈP 2 P \Sigma_2^P \cup \Pi_2^P Lower Bound Using Mobile Membranes
Width Measures of Alternating Finite Automata
Aspects of Enumeration and Generation with a String Automata Representation
Disjunctive Complexity
A Local Limit Property for Pattern Statistics in Bicomponent Stochastic Models
Most Complex Regular Right-Ideal Languages
Descriptional Complexity of Formal Systems - 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, Proceedings
The Quotient Operation on Input-Driven Pushdown Automata
Descriptional Complexity of Formal Systems - 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings
On the Power of Generalized Forbidding Insertion-Deletion Systems
Optimal Simulations of Weak Restarting Automata
Linear Algebra Based Bounds for One-Dimensional Cellular Automata
Regular Expression Length via Arithmetic Formula Complexity
Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language Theory
Regulated Tree Automata
Pushdown Automata and Constant Height: Decidability and Bounds
On the Synchronized Derivation Depth of Context-Free Grammars
Bad Pictures: Some Structural Properties Related to Overlaps
A Polynomial Complexity Class in P Systems Using Membrane Division
On Recursive and Non-Recursive Trade-Offs Between Finite-Turn Pushdown Automata
State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages
Descriptional Complexities of Grammars over Alphabets with Finite Parameters
Limited Automata: Properties, Complexity and Variants
The Syntactic Complexity of Semi-flower Languages
Special Variants of P Systems with One Catalyst in One Membrane
On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
Avoiding Overlaps in Pictures
Refining the Nonterminal Complexity of Graph-controlled Grammars
Two-way non-deterministic finite automata with a write-once track recognize regular languages only
Self-attraction Removal from Oritatami Systems
Efficient Simulation of Nondeterministic Weighted Finite Automata
Cycle Height of Finite Automata
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion
Cover Complexity of Finite Languages
Blum Static Complexity and Encoding Spaces
Descriptional Complexity of Alternating Finite Automata
Deciding Representability of Sets of Words of Equal Length
How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory?
Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star
Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable
Groups Whose Word Problem is a Petri Net Language
Fibonacci Pictures on a Binary Alphabet
On Two Hierarchies of Subregularly Tree Controlled Languages
On the Number of Components in Cooperating Distributed Grammar Systems
Operations on Weakly Recognizing Morphisms
Sophistication as Randomness Deficiency
NP Predicates Computable in the Weakest Level of the Grzegorczyck Hierarchy
State Complexity Characterizations of Parameterized Degree-Bounded Graph Connectivity, Sub-Linear Space Computation, and the Linear Space Hypothesis
Star-Complement-Star on Prefix-Free Languages
Computing with Capsules
Operational State Complexity of Nested Word Automata
A Pumping Lemma for Ordered Restarting Automata
Grammars with Bounded-Life Resources
Context Derivation Sets and Context-Free Normal Forms
Note on Reversal of Binary Regular Languages
More on the Descriptional Complexity of Products of Finite Automata
Circuit Complexity, Kolmogorov Complexity, and Prospects for Lower Bounds
Image-Binary Automata
Unambiguity in Automata Theory
Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals
Regulated RNA rewriting: modelling RNA editing with guided insertion
Complexity of Extended vs. Classic LR Parsers
Non-Uniqueness and Radius of Cyclic Unary NFAs
Complexity of Exclusive Nondeterministic Finite Automata
Representations and Characterizations of Languages in Chomsky Hierarchy by Means of Insertion-Deletion Systems
State-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length
Insertion-Deletion with Substitutions II
Boundary Sets of Regular and Context-Free Languages
A characterization of the arithmetical hierarchy by language equations
Simple-Regular Expressions and Languages
k-Local Graphs
Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs
The State Complexity of Permutations on Finite Languages over Binary Alphabets
Randomness Behaviour in Blum Universal Static Complexity Spaces
The degree of parallelism
State Complexity of Partial Word Finite Automata
Unrestricted State Complexity of Binary Operations on Regular Languages
On the time, space and communication complexity of q-fair languages
Iterating Invertible Binary Transducers
State Complexity of Some Operations on Regular Languages
Degrees of (Non)Monotonicity of RRW-Automata
k -Local Internal Contextual Grammars
State Complexity of Shuffle on Trajectories
Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems
Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems
On the Average Complexity of Strong Star Normal Form
On the Generation of 2-Polyominoes
Complexity Issues in Rewriting P Systems
Prefix-Free Languages: Right Quotient and Reversal
On the Complexity and Decidability of Some Problems Involving Shuffle
On the Descriptional Complexity of Path Optimization in Graphs
Merging Two Hierarchies of External Contextual Grammars with Subregular Selection
Synchronization of Communication
On Inverse Operations and Their Descriptional Complexity
On Simulation Cost of Unary Limited Automata
What is the Most Natural Generalized Pumping Lemma beyond Regular and Context-Free Languages?
On the State Complexity of Closures and Interiors of Regular Languages with Subwords
Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, London, ON, Canada, July 22-25, 2013. Proceedings
Some Properties of the Prouhet Morphism and Words
State Trade-Offs in Unranked Tree Automata
Small Balanced Vertex Separators in NFA to Regular Expression Conversion
The Power of Centralized PC Systems of Pushdown Automata
Small Universal Non-deterministic Petri Nets with Inhibitor Arcs
Economy of Descriptions for Basic Constructions on Rational Transductions
Models of Self-healing Software Systems
Non-returning PC Grammar Systems Generate Any Recursively Enumerable Language with Eight Context-free Components
Word Problem Languages for Free Inverse Monoids
Automata for Synchronised Shuffle on Backbones
A Powerful Tool in Lower-Bounding Constantly Ambiguous Automata
Automata with Reversal-Bounded Counters: A Survey
The Separation Problems and Descriptional Complexity
On the Descriptional Complexity of Lindenmayer Systems
Universal Disjunctive Concatenation and Star
Nonterminal Complexity of Some Operations on Context-Free Languages
Descriptional Complexity of Formal Systems - 26th IFIP WG 1.02 International Conference, DCFS 2025, Loughborough, UK, July 22-24, 2025, Proceedings
Equivalent Transformation of Minimal Finite Automata over a Two-Letter Alphabet
Uncountable Realtime Probabilistic Classes
Most Complex Deterministic Union-Free Regular Languages
Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21 - 24, 2002. Pre-proceedings
Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract)
Parallel Communicating Pushdown Automata with Filters in Communication
Uniform Distributed Pushdown Automata Systems
Mutually Accepting Capacitated Automata
Remarks on Multiple Entry Deterministic Finite Automata
State Complexity of Chop Operations on Unary and Finite Languages
Disambiguation of Weighted Tree Automata
Cellular Automata and Descriptional Complexity
On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata
Finite Automata with Undirected State Graphs
Separating Words Problem over Groups
Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings
Recognizing Collapsing Words is co-NP-Complete
On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection
Classical Automata on Promise Problems
Descriptional Complexity of Biautomata
Finite Nondeterminism vs. DFAs with Multiple Initial States
Syntactic Complexity of - and -Trivial Regular Languages
Further Closure Properties of Input-Driven Pushdown Automata
A Regularity Condition for Context-Free Grammars
On Possible Extensions and Relationships Between Software Reliability, Software Metrics and Descriptional Complexity
State Complexity and Proportional Removals
Using Abstract State Machines for the Description and the Analysis of Formal Systems
Descriptional Complexity of Bounded Regular Languages
Nondeterministic Biautomata and Their Descriptional Complexity
Removing Nondeterminism in Constant Height Pushdown Automata
State complexity of linear conjunctive languages
Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata
Learning Unary Automata
Longer Shortest Strings in Two-Way Finite Automata
Some Complexity Aspects of Hybrid Networks of Evolutionary Processors
Advice for Semifeasible Sets and the Complexity-Theoretic Cost(lessness) of Algebraic Properties
On Classes of Regular Languages Related to Monotone WQOs
State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages