Expertini Research Research

Browse Research Papers

10,718+ open-access research outputs.

✕ Clear
🔍 daniel m. gordon 📂 Computer Science
Showing 10718 results for "daniel m. gordon" in Computer Science
Computer Science Preprint PDF DOI

A Generalisation of Goursat's Algorithm for Integration in Finite Terms

Sam Blake · 2026

We give a self-contained, modern exposition of \'Edouard Goursat's 1887 theorem on pseudo-elliptic integrals -- those integrals of the form $\int F(t)\,\d t/\sqrt{R(t)}$ with $R$ a cubic or quartic po…

Read Paper →
Computer Science Preprint PDF DOI

Why Self-Supervised Encoders Want to Be Normal

Yuval Domb · 2026

We develop a geometric and information-theoretic framework for encoder-decoder learning built on the Information Bottleneck (IB) principle. Recasting IB as a rate-distortion problem with Kullback-Leib…

Read Paper →
Computer Science Preprint PDF DOI

treVM: Tiny Rust Embedded Virtual Machines with WASM on Variable Resource-Constrained Hardware

Antoine Lavandier, Bastien Buil, Chrystel Gaber, Emmanuel Baccelli · 2026

Software stacks embedded on microcontroller-based hardware typically provide rudimentary APIs programmed in C/C++, basic connectivity and, sometimes, a firmware update mechanism. Such coarse mechanism…

Read Paper →
Computer Science Preprint PDF DOI

Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time

Loukas Georgiadis, Evangelos Kipouridis, Evangelos Kosinas, Charis Papadopoulos, Nikos Parotsidis · 2026

Computing edge-connected components in directed and undirected graphs is a fundamental and well-studied problem in graph algorithms. In a very recent breakthrough, Korhonen [STOC 2025] showed that for…

Read Paper →
Computer Science Preprint PDF DOI

A proof of Jordan curve theorem based on the sweepline algorithm for trapezoidal decomposition of a polygon

Apurva Mudgal · 2026

We prove the Jordan curve theorem by generalizing the sweepline algorithm for trapezoidal decomposition of a polygon. Our proof uses Zorn's lemma (or, equivalently the axiom of choice). Though several…

Read Paper →
Computer Science Preprint PDF DOI

MISES: Minimal Information Sufficiency for Effective Service

Joss Armstrong · 2026

Category-based coordination mechanisms allocate resources by mapping a declared service category to a fixed resource profile, without observing individual demand types. We establish three results for …

Read Paper →
Computer Science Preprint PDF DOI

Rank Distribution and Dynamics of Gram Matrices from Binary m-Sequences with Applications to LCD Codes

Hengfeng Liu, Chunming Tang, Cuiling Fan, Zhengchun Zhou · 2026

The Gram matrix is a classical object formed from the pairwise inner products of a collection of vectors, with fundamental roles in functional analysis, statistics, combinatorics, and coding theory. I…

Read Paper →
Computer Science Preprint PDF DOI

Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems

Takayoshi Shoudai, Satoshi Matsumoto, Yusuke Suzuki, Tomoyuki Uchida · 2026

Distributional learning provides a framework for studying the learnability of structured languages from positive data. In this paper, we extend this framework to graph languages generated by fixed-int…

Read Paper →
Computer Science Preprint PDF DOI

Incremental Strongly Connected Components with Predictions

Ronald Deng, Samuel McCauley, Aidin Niaparast, Helia Niaparast, Bennett Ptak, Shirel Quintanilla, Shikha Singh, Nathan Vosburg · 2026

Algorithms with predictions is a growing area that aims to leverage machine-learned predictions to design faster beyond-worst-case algorithms. In this paper, we use this framework to design a learned …

Read Paper →
Computer Science Preprint PDF DOI

Embedded Rust or C Firmware? Lessons from an Industrial Microcontroller Use Case with Ariel OS

Bipin Thapa, Daniele Alfonso, Lorenzo Bini, Licio Mapelli, Kaspar Schleiser, Romain Fouquet, Emmanuel Baccelli · 2026

As Rust gains traction for developing safer systems software, a reality check for the microcontroller hardware segment becomes necessary. How ready is the Rust ecosystem for this segment? Can Rust com…

Read Paper →
Computer Science Preprint PDF DOI

PSP: An Interpretable Per-Dimension Accent Benchmark for Indic Text-to-Speech

Venkata Pushpak Teja Menta · 2026

Standard text-to-speech (TTS) evaluation measures intelligibility (WER, CER) and overall naturalness (MOS, UTMOS) but does not quantify accent. A synthesiser may score well on all four yet sound non-n…

Read Paper →
Computer Science Preprint PDF DOI

On the Minimum Distances of Some Families of Goppa Codes and BCH Codes

Yaqi Chen, Hao Chen, Cunsheng Ding, Huimin Lao · 2026

Goppa codes form an important class of alternant codes with wide applications in algebraic coding theory and code-based cryptography. Determining the true minimum distance of a Goppa code is a difficu…

Read Paper →
Computer Science Preprint PDF DOI

Job-Scheduling Games with Time-Dependent Processing Times

Ido Borenstein, Tami Tamir · 2026

Job-scheduling games have traditionally assumed fixed processing times. However, in many realistic environments, ranging from cyber-security response to high-frequency trading, a task's duration depen…

Read Paper →
Computer Science Preprint PDF DOI

Covariance-Aware Demapping on Fourier-Curve Constellations

Bin Han, Muxia Sun, H. Vincent Poor, Hans D. Schotten · 2026

Injecting artificial noise (AN) along the tangent space of a curved constellation makes each transmitted symbol induce a Gaussian observation with a symbol-dependent rank-one covariance, so the matche…

Read Paper →
Computer Science Preprint PDF DOI

Machine-Checked Cardinality Bounds for Masked Barrett Reduction: A 1-Bit Side-Channel Leakage Barrier in Post-Quantum Cryptographic Hardware

Ray Iskander, Khaled Kirah · 2026

Barrett reduction is the nonlinear core of every practical NTT-based post-quantum cryptography implementation. Existing composition frameworks (ISW, t-SNI, PINI, DOM) address Boolean masking over GF(2…

Read Paper →
Computer Science Preprint PDF DOI

Measuring the Unmeasurable: Markov Chain Reliability for LLM Agents

Phat T. Tran-Truong, Xuan-Bach Le · 2026

Large language model (LLM) agents increasingly operate as sequential software systems, but their reliability is often summarized by scalar benchmark metrics. Metrics such as pass$@k$, pass$^k$, and th…

Read Paper →
Computer Science Preprint PDF DOI

Resolving Conflicts Between RTOS Timekeeping and Uninterruptable Trusted Computing

Antonio Joia Neto, Amarin Laohajirapan, Norrathep Rattanavipanon, Ivan De Oliveira Nunes · 2026

Trusted Execution Environments (TEEs) on low-power microcontrollers (e.g., ARM TrustZone-M) enable isolation of Secure and Non-Secure software but still require both worlds to share resources, includi…

Read Paper →
Computer Science Preprint PDF DOI

Near-Optimal Heaps and Dijkstra on Pointer Machines

Ivor van der Hoog, John Iacono, Eva Rotenberg, Daniel Rutschmann · 2026

A heap is a dynamic data structure that stores a set of labeled values under the following operations: pop returns the minimum value of the heap, Push($x_i$) pushes a new value $x_i$ onto the heap, an…

Read Paper →
Computer Science Preprint PDF DOI

Near-tight Bounds for Computing the Fr\'echet Distance in d-Dimensional Grid Graphs and the Implications for {\lambda}-low Dense Curves

Jacobus Conradi, Ivor van der Hoog, Frederikke Uldahl, Eva Rotenberg · 2026

The Fr\'echet distance is a popular distance measure between trajectories or curves in space, or between walks in graphs. We study computing the Fr\'echet distance between walks in the $d$-dimensional…

Read Paper →
Computer Science Preprint PDF DOI

Dynamic Grammar-Compressed Self-Index in $\delta$-Optimal Space

Takaaki Nishimoto, Yasuo Tabei · 2026

A compressed self-index stores a string in compressed form while supporting locate queries without decompression. For highly repetitive strings (arising in web crawls, versioned documents, and genomic…

Read Paper →
Page 1 of 536 Next →