yusuke1997/dblp-id-title huggingface dataset:
Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes
On Ladner's Result for a Class of Real Machines with Restricted Use of Constants
Weihrauch Problems as Containers
Avoiding Simplicity Is Complex
Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended Abstract)
Elementary Algebraic Specifications of the Rational Function Field
A C.E. Weak Truth Table Degree Which Is Array Noncomputable and R-maximal
The Typical Constructible Object
Effective Strong Nullness and Effectively Closed Sets
The Computational Significance of Hausdorff's Maximal Chain Principle
Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings
Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable
A Note on Computable Embeddings for Ordinals and Their Reverses
The Limits of Tractability in Resolution-Based Propositional Proof Systems
On Simulation in Automata Networks
Processes in Space
Towards Computable Analysis on the Generalised Real Line
Partially Ordered Connectives and Sum 1 1 on Finite Models
On the Computational Power of Enhanced Mobile Membranes
Turing Jumps Through Provability
On the Kolmogorov Complexity of Continuous Real Functions
A Classification of Viruses Through Recursion Theorems
Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model
The Complexity of Small Universal Turing Machines
Full Generalized Effective Reducibility
Computable Riemann Surfaces
Recent Advances in the Computation of the Homology of Semialgebraic Sets
0 " -Categorical Completely Decomposable Torsion-Free Abelian Groups
Bayesian Data Integration and Enrichment Analysis for Predicting Gene Function in Malaria
Turing Universality in Dynamical Systems
New Bounds on Optimal Sorting Networks
Polynomial-Time Presentations of Algebraic Number Fields
Higher Type Recursion for Transfinite Machine Theory
Baire Category Theory and Hilbert's Tenth Problem Inside \mathbb Q Q
Communication Modalities
Exact Pair Theorem for the omega -Enumeration Degrees
Foundational Analyses of Computation
Semantic Security and Key-Privacy with Random Split of St-Gen Codes
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
Towards an Axiomatic System for Kolmogorov Complexity
Proof Mining in Functional Analysis
Correlation Dimension and the Quality of Forecasts Given by a Neural Network
Chaitin Omega Numbers and Halting Problems
A Computational Approach to an Alternative Working Environment for the Constructible Universe
Towards a Theory of Infinite Time Blum-Shub-Smale Machines
Parallelizations in Weihrauch Reducibility and Constructive Reverse Mathematics
A Correspondence Principle for Exact Constructive Dimension
Constraints on Hypercomputation
Borel and Baire Sets in Bishop Spaces
Input-Dependence in Function-Learning
Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings
On 3SUM-hard Problems in the Decision Tree Model
Optimized Program Extraction for Induction and Coinduction
A Measure of Space for Computing over the Reals
Infinite Computations and a Hierarchy in Delta 3
The Power of Mobility: Four Membranes Suffice
Implementing Spi Calculus Using Nominal Techniques
Counting the Changes of Random D 0 2 Sets
On the Behavior of Tile Assembly System at High Temperatures
An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability
Probabilistic Models of k-mer Frequencies (Extended Abstract)
A Continuous Derivative for Real-Valued Functions
Probabilistic Analysis of Facility Location on Random Shortest Path Metrics
Computability of Continuous Solutions of Higher-Type Equations
Squeezing Feasibility
Fit-Preserving Data Refinement of Mass-Action Reaction Networks
The Polynomial and Linear Hierarchies in V 0
A New Approach to the Paperfolding Sequences
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
The Strength of the Besicovitch-Davies Theorem
Automatic Functions, Linear Time and Learning
On the Complexity of Validity Degrees in Łukasiewicz Logic
Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings
A Slime Mold Solver for Linear Programming Problems
Inverting Monotone Continuous Functions in Constructive Analysis
Some Structural Complexity Results for $\exists {\mathbb {R}}$
A Direct Proof of Wiener's Theorem
Eliminating Unbounded Search in Computable Algebra
Game Characterizations and Lower Cones in the Weihrauch Degrees
Densities and Entropies in Cellular Automata
Existential Definability of Unary Predicates in Büchi Arithmetic
Defining Languages by Forbidding-Enforcing Systems
The Complexity of Tukey Types and Cofinal Types
Automatic Learners with Feedback Queries
Does the Cell Compute?
Functions Definable by Arithmetic Circuits
Schnorr Dimension
Unveiling Dynamics and Complexity - 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings
Non-Recursive Trade-Offs Are "Almost Everywhere"
A Point to Set Principle for Finite-State Dimension
On Subrecursive Representation of Irrational Numbers: Contractors and Baire Sequences
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs
The Complexity of Inductive Definability
Domain-Theoretic Formulation of Linear Boundary Value Problems
On the Lattices of Effectively Open Sets
The Complexity of Quickly ORM-Decidable Sets
The FPGA-Based High-Performance Computer RIVYERA for Applications in Bioinformatics
A Faster Algorithm for Finding Minimum Tucker Submatrices
Updatable Timed Automata with Additive and Diagonal Constraints
The Analogue of Büchi's Problem for Polynomials
Colocatedness and Lebesgue Integrability
Finding Most Likely Solutions
On Mathematicians Who Liked Logic - The Case of Max Newman
Dialectica Interpretation with Fine Computational Control
The Peirce Translation and the Double Negation Shift
Computing with Concepts, Computing with Numbers: Llull, Leibniz, and Boole
Multi-Resolution Cellular Automata for Real Computation
Some Results on Interactive Proofs for Real Computations
The Uniformity Principle for Sigma -Definability with Applications to Computable Analysis
Combinatorial Properties of Degree Sequences of 3-Uniform Hypergraphs Arising from Saind Arrays
Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games
Randomness and Differentiability of Convex Functions
Computability of Countable Subshifts
Nonexistence of Minimal Pairs in L[d]
The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated Models
Finitely Generated Semiautomatic Groups
Circuit Complexity and Multiplicative Complexity of Boolean Functions
Software Streams: Big Data Challenges in Dynamic Program Analysis
Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds
Cardinal-Recognizing Infinite Time Turing Machines
New Algorithmic Paradigms in Exponential Time Algorithms
On Conservative Learning of Recursively Enumerable Languages
Development of a Bacteria Computer: From in silico Finite Automata to in vitro and in vivo
A Weakly 2-Random Set That Is Not Generalized Low
Splicing Systems: Accepting Versus Generating
A Weak First-Order Theory of Sequences
Effective Second Countability in Computable Analysis
A Direct Constructive Proof of a Stone-Weierstrass Theorem for Metric Spaces
Computable Analysis and Classification Problems
Computable Transformations of Structures
On Accepting Networks of Splicing Processors of Size 3
Combinatorial Models of Gene Assembly
Local Induction and Provably Total Computable Functions: A Case Study
Constructing Continuous Systems from Discrete Cellular Automata
Robust Online Algorithms for Dynamic Choosing Problems
Admissible Representations in Computable Analysis
After Turing: Mathematical Modelling in the Biomedical and Social Sciences - From Animal Coat Patterns to Brain Tumours to Saving Marriages
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability
Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis
Higher-Order Containers
KL-Randomness and Effective Dimension Under Strong Reducibility
On a Question of Sacks - A Partial Solution on the Positive Side
Short Lists with Short Programs in Short Time - A Short Proof
Towards the Effective Descriptive Set Theory
Turning Block-Sequential Automata Networks into Smaller Parallel Networks with Isomorphic Limit Dynamics
Counting Simple Rules in Semi-conditional Grammars is not Simple
Unique Existence and Computability in Constructive Reverse Mathematics
The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines
Maximal Ideals in Countable Rings, Constructively
Universality in Freezing Cellular Automata
A Logical Approach to Abstract Algebra
Ordinal Analysis and the Infinite Ramsey Theorem
Computing K-Trivial Sets by Incomplete Random Sets
Membrane Computing: Power, Efficiency, Applications
Multi-valued Logics, Effectiveness and Domains
Diminishable Parameterized Problems and Strict Polynomial Kernelization
Computability and Discrete Dynamical Systems
On Graph Isomorphism for Restricted Graph Classes
Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It
Kalmár's Argument for the Independence of Computer Science
A Deontic Logic Reasoning Infrastructure
Comparing C.E. Sets Based on Their Settling Times
Computability and Incomputability
Nets and Reverse Mathematics - Some Initial Results
Presentations of K-Trivial Reals and Kolmogorov Complexity
Péter on Church's Thesis, Constructivity and Computers
Sofic Trace Subshift of a Cellular Automaton
Membrane Systems and Their Application to Systems Biology
Logspace Complexity of Functions and Structures
On Measure Quantifiers in First-Order Arithmetic
An Undecidable Nested Recurrence Relation
Learning Languages with Decidable Hypotheses
Lower Bound on Weights of Large Degree Threshold Functions
Linear Transformations in Boolean Complexity Theory
Reachability in Linear Dynamical Systems
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
On the Foundations and Philosophy of Info-metrics
Constructive Analysis of Maximal Ideals in $\mathbb {Z}[X]$ by the Material Interpretation
Computability of Analytic Functions with Analytic Machines
Can General Relativistic Computers Break the Turing Barrier?
A Useful Undecidable Theory
The Isometry Degree of a Computable Copy of 𝓁 p
Focusing in Asynchronous Games
The Non-normal Abyss in Kleene's Computability Theory
What Is the Problem with Proof Nets for Classical Logic?
Evolving Computability - 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29 - July 3, 2015. Proceedings
Multiple Permitting and Array Noncomputability
Dimension Spectra of Lines
Partial Recursive Functions in Martin-Löf Type Theory
Hyperprojective Hierarchy of qcb 0 -Spaces
On the Reverse Mathematics of Cut-Elimination and Determinacy
Characterizing Programming Systems Allowing Program Self-reference
Herbrand Theorems and Skolemization for Prenex Fuzzy Logics
Refocusing Generalised Normalisation
Presentations of Structures in Admissible Sets
Representations of Natural Numbers and Computability of Various Functions
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
Almost Sure OTM-Realizability
Inference Concerning Physical Systems
Fixed Points and Attractors of Reaction Systems
Extending Wagner's Hierarchy to Deterministic Visibly Pushdown Automata
Early Machine Translation - Integration and Transfers between Computing and the Language Sciences
Restrictions of Hindman's Theorem: An Overview
Quasi-linear Dialectica Extraction
Computability of Limit Sets for Two-Dimensional Flows
Minimum Entropy Combinatorial Optimization Problems
Uniform Schemata for Proof Rules
Arthur-Merlin Games and the Problem of Isomorphism Testing
Kalmár and Péter: Undecidability as a Consequence of Incompleteness
Rice's Theorem in Effectively Enumerable Topological Spaces
The Turing Universe in the Context of Enumeration Reducibility
The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words
Using Structural Properties for Integer Programs
On the Ramseyan Factorization Theorem
Generalized Learnability of Stochastic Principles
Computing Equilibria in Large Games We Play
Recursion on Nested Datatypes in Dependent Type Theory
Non-collapse of the Effective Wadge Hierarchy
Ergodic-Type Characterizations of Algorithmic Randomness
Computing with Multisets: A Survey on Reaction Automata Theory
An Early Completion Algorithm: Thue's 1914 Paper on the Transformation of Symbol Sequences
Computability in Symbolic Dynamics
Deciding According to the Shortest Computations
Space-Bounded Online Kolmogorov Complexity is Additive
Liquid Computing
Hard Instances of Algorithms and Proof Systems
Towards Uniform Online Spherical Tessellations
On the Tarski-Lindenbaum Algebra of the Class of all Strongly Constructivizable Prime Models
Stability under Strategy Switching
Enumerating Classes of Effective Quasi-Polish Spaces
Elementary Bi-embeddability Spectra of Structures
Enumerations and Torsion Free Abelian Groups
Faster Online Computation of the Succinct Longest Previous Factor Array
On Maximal Block Functions of Computable η-like Linear Orderings
On the Computational Content of Termination Proofs
A Unified Framework for Designing EPTAS's for Load Balancing on Parallel Machines
Feasible Depth
Some Games on Turing Machines and Power from Random Strings
P w {\cal P}_w Is Not a Heyting Algebra
A Summation Algorithm from 11th Century China
Biochemical Reactions as Computations
The Relative Consistency of the Axiom of Choice - Mechanized Using Isabelle/ZF
On Envelopes and Backward Approximations
Accepting Networks of Splicing Processors
Completeness Theorems for Modal Logic in Second-Order Arithmetic
On the Computational Power of rmC-Random Strings
Generalized Effective Reducibility
Graph Polynomials Motivated by Gene Rearrangements in Ciliates
Structural Complexity of Rational Interactive Proofs
Computability of Ordinary Differential Equations
Verifying Systems of Resource-Bounded Agents
What Is the Concept of Computation?
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization
'Stored Program Concept' Considered Harmful: History and Historiography
Describing the Wadge Hierarchy for the Alternation Free Fragment of µ-Calculus (I)
Lower Bounds on β (α )
How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems
Represented Spaces of Represented Spaces
What Are Computers (If They're not Thinking Things)?
Computational Complexity Aspects in Membrane Computing
Shrad: A Language for Sequential Real Number Computation
Doing Without Turing Machines: Constructivism and Formal Topology
Gödel's Reception of Turing's Model of Computability: The "Shift of Perception" in 1934
An Introduction to Program and Thread Algebra
Computable Ordered Abelian Groups and Fields
How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings
Every D 0 2 \Delta^0_2-Set Is Natural, Up to Turing Equivalence
RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
Symmetric Enumeration Reducibility
Locally Computable Structures
Kernelization Lower Bounds for Finding Constant-Size Subgraphs
Incomputability in Physics
Continuous Semantics for Strong Normalization
What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem?
Weak Sequential Theories of Finite Full Binary Trees
Hairpin Lengthening
Parameterized Inapproximability of Target Set Selection and Generalizations
Bounded Reducibility for Computable Numberings
Topological Analysis of Representations
A Candidate for the Generalised Real Line
Constraint Logic Programming for Resolution of Relative Time Expressions
Types in Programming Languages, Between Modelling, Abstraction, and Correctness - Extended Abstract
Some Natural Zero One Laws for Ordinals Below ε 0
Computability in Amorphous Structures
Admissibles in Gaps
The Shrinking Property for NP and coNP
A simulated system for teaching computer architecture
PSATSim: an interactive graphical superscalar architecture simulator for power and performance analysis
Dual-Submission Homework in Parallel Computer Architecture: An Exploratory Study in the Age of LLMs
Adopting new learning strategies for computer architecture in higher education: case study: building the S3 microprocessor in 24 hours
Reconfigurable hardware devices evoluation: an important opportunity for full span computer architecture education
The liberty simulation environment as a pedagogical tool
Experiencing quantitative computer architecture
A network-computing infrastructure for tool experimentation applied to computer architecture education
Proceedings of the 2004 workshop on Computer architecture education - Held in conjunction with the 31st International Symposium on Computer Architecture, WCAE@ISCA 2004, Munich, Germany, June 19, 2004
PIPS: An Instruction Set Architecture for Teaching Computer Organization
An embedded systems course and course sequence
Building blocks and their interactions: an object-oriented approach to computer organization and design
MipsIt: a simulation and development environment using animation for computer architecture education
LupIO: a collection of education-friendly I/O devices
An integrated approach to teaching computer systems architecture
An execution-driven simulation tool for teaching cache memories in introductory computer organization courses
Simulation and analysis in the small: the case for simple models, metrics and microbenchmarks in computer architecture teaching and research
Why write real software in a university?
RSIM: a simulator for shared-memory multiprocessor and uniprocessor systems that exploit ILP
On the introduction of reconfigurable hardware into computer architecture education
On the design of a new CPU architecture for pedagogical purposes
DYRECT: a dynamic reconfiguration tool for multicomputer systems
An experimental laboratory environment for teaching embedded hardware systems
How computers really work: a children's guide
Creating sharable learning objects from existing digital course content
Improving computer architecture education through the use of questioning
Using rapid prototyping in computer architecture design laboratories
The architecture curriculum at UC-Davis
Computer architecture development courses in Toulouse Universities
ACM/IEEE Workshop on Computer Architecture Education, WCAE 2021, Raleigh, NC, USA, June 17, 2021
Interactive CPU simulator for computer organization instruction
Use of HDLs in teaching of computer hardware courses
PyCompArch: python-based modules for exploring computer architecture concepts
Tareador: a tool to unveil parallelization strategies at undergraduate level
DEMAC: A Platform for Education in High-performance Computing, Bridging the Gap Between Users and Hardware
Why you should build a super-scalar pipeline simulator
Using the computer architecture course database
Computer architecture education in a corporate reengineering program
Using verilog HDL to teach computer architecture concepts
esim : a structural design language and simulator for computer architecture education
Performance monitoring in advanced computer architecture
The Davis In-Order (DINO) CPU: A Teaching-focused RISC-V CPU Design
A database of course materials in computer architecture
In-lecture hardware demonstrations with a logic analyzer to illustrate pipelined execution and cache/memory behavior
ChipDesign: from theory to real world
Pedagogic value in understanding computer architecture of implementing the marie computer from null and lobur in the logic emulation software, multimedia logic
An emulated computer with assembler for teaching undergraduate computer architecture
Education in computer science and computer engineering starts with computer architecture
A proposal to introduce power and energy notions in computer architecture laboratories
Keeping old computers alive for deeper understanding of computer architecture
Understanding cache hierarchy interactions with a program-driven simulator
Visual simulator for ILP dynamic OOO processor
VLIW-DLX simulator for educational purposes
Remote operation and control of computer engineering laboratory experiments
The computer architecture curriculum at Stanford: challenges and approaches
CoDeNios: a function level co-design tool
Developing a computer science/engineering textbook
Teaching computer organization/architecture by building a computer
Components of a computer architecture education
QUILT: a GUI-based integrated circuit floorplanning environment for computer architecture research and education
What and why about architecture for embedded systems
SENS, design, development and evaluation of a digital course on signal processing
Petri nets as a tool for teaching operating systems
Integrating hardware and software concepts in a microprocessor-based system design lab
Towards teaching embedded parallel computing: an analytical approach
The undergraduate curriculum in the electrical and computer engineering department at the University of Texas at Austin
Using Logisim-evolution for Teaching Datapath and Control
CPU design kit: an instructional prototyping platform for teaching processor design
Operating-system level tracing tools for the DEC AXP architecture
Proceedings of the 1995 Workshop on Computer Architecture Education, WCAE@ISCA 1995, Santa Margherita Ligure, Italy, June 1995
Update plans: pointers in teaching computer architecture
The 'Little Man Storage' model
Using FPGA for computer architecture/organization education
An enhanced DLX-based superscalar system simulator
The changing role of computer architecture education within CS curricula: invited presentation
Exposing Abstraction-Level Interactions with a Parallel Ray Tracer
Parallel Computing At The Undergraduate Level: Lessons Learned and Insights
TupleDSM: an educational tool for software distributed shared memory
A Framework for Microarchitecture Traces as Abstraction Layer in Computer Architecture Education
Combining learning strategies and tools in a first course in computer architecture
Computer architecture instruction at the University of Michigan
A Free Online Textbook Introducing Computer Architecture Topics
An integrated laboratory for computer architecture and networking
Development of a digital instrument as a motivational component in teaching embedded computers
Proceedings of the 2002 workshop on Computer architecture education - Held in conjunction with the 29th International Symposium on Computer Architecture, WCAE@ISCA 2002, Anchorage, Alaska, USA, May 26, 2002
Proceedings of the 1996 workshop on Computer architecture education, WCAE@HPCA 1996, San Jose, CA, USA, February 1996
An Approach for a Project-Based Digital Logic Design Course Using an Innovative Simulator
Computer architecture at the University of California, Berkeley
Bridges to computer architecture education
Proceedings of the Workshop on Computer Architecture Education, WCAE 2023, Orlando, FL, USA, June 17-21, 2023
Building resources for teaching computer architecture through electronic peer review
An integrated learning support environment for computer architecture
Multimedia components for the visualization of dynamic behavior in computer architectures
Evaluating the performance of dynamic branch prediction schemes with BPSim
A pedagogically targeted logic design and simulation tool
Students' experimental processor: a processor integrated with different types of architectures for educational purposes
Proceedings of the 2000 workshop on Computer architecture education, WCAE@ISCA 2000, Vancouver, BC, Canada, June 10, 2000
SATSim: a superscalar architecture trace simulator using interactive animation
Using surface-mount components in an embedded systems lab
Proceedings of the 1999 workshop on Computer architecture education, WCAE@HPCA 1999, Orlando, FL, USA, January 1999
A lab course of computer organization
A lab course on computer architecture