Expertini Research Research

Browse Research Papers

113+ open-access research outputs.

✕ Clear
🔍 w.j. munro 📂 Computer Science
Showing 113 results for "w.j. munro" in Computer Science
Computer Science Preprint PDF DOI

Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps

Daniel Rutschmann · 2026

In 1972, Fredman proposes the problem of sorting under partial information: preprocess a directed acyclic graph $G$ with vertex set $X$ so that you can sort $X$ in $O(\log e(G))$ time, where $e(G)$ is…

Read Paper →
Computer Science Preprint PDF DOI

Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling

Karl Bringmann, Anita Durr, Karol Wegrzycki · 2026

Bin Packing with $k$ bins is a fundamental optimisation problem in which we are given a set of $n$ integers and a capacity $T$ and the goal is to partition the set into $k$ subsets, each of total sum …

Read Paper →
Computer Science Preprint PDF DOI

Multi-channel multi-speaker transformer for speech recognition

Guo Yifan, Tian Yao, Suo Hongbin, Wan Yulong · 2026

With the development of teleconferencing and in-vehicle voice assistants, far-field multi-speaker speech recognition has become a hot research topic. Recently, a multi-channel transformer (MCT) has be…

Read Paper →
Computer Science Preprint PDF DOI

Improved Online Load Balancing in the Two-Norm

Sander Borst, Danish Kashaev · 2025

We study the online load balancing problem on unrelated machines, with the objective of minimizing the square of the $\ell_2$ norm of the loads on the machines. The greedy algorithm of Awerbuch et al.…

Read Paper →
Computer Science Preprint PDF DOI

VM-UNSSOR: Unsupervised Neural Speech Separation Enhanced by Higher-SNR Virtual Microphone Arrays

Shulin He, Zhong-Qiu Wang · 2025

Blind speech separation (BSS) aims to recover multiple speech sources from multi-channel, multi-speaker mixtures under unknown array geometry and room impulse responses. In unsupervised setup where cl…

Read Paper →
Computer Science Preprint PDF DOI

Algorithms for Dynamic Computational Geometry with Applications

Laurence Boxer · 2025

Most of the literature of computational geometry concerns geometric properties of sets of static points. M.J. Atallah introduced dynamic computational geometry, concerned with both momentary and long-…

Read Paper →
Computer Science Preprint PDF DOI

Regular Model Checking for Systems with Effectively Regular Reachability Relation

Javier Esparza, Valentin Krasotin · 2025

Regular model checking is a well-established technique for the verification of regular transition systems (RTS): transition systems whose initial configurations and transition relation can be effectiv…

Read Paper →
Computer Science Preprint PDF DOI

Selfish, Local and Online Scheduling via Vector Fitting

Danish Kashaev · 2025

We provide a dual fitting technique on a semidefinite program yielding simple proofs of tight bounds for the robust price of anarchy of several congestion and scheduling games under the sum of weighte…

Read Paper →
Computer Science Preprint PDF DOI

Elevating Robust Multi-Talker ASR by Decoupling Speaker Separation and Speech Recognition

Yufeng Yang, Hassan Taherian, Vahid Ahmadi Kalkhorani, DeLiang Wang · 2025

Despite the tremendous success of automatic speech recognition (ASR) with the introduction of deep learning, its performance is still unsatisfactory in many real-world multi-talker scenarios. Speaker …

Read Paper →
Computer Science Preprint PDF DOI

Optimal $k$-Secretary with Logarithmic Memory

Mingda Qiao, Wei Zhang · 2025

We study memory-bounded algorithms for the $k$-secretary problem. The algorithm of Kleinberg (2005) achieves an optimal competitive ratio of $1 - O(1/\sqrt{k})$, yet a straightforward implementation r…

Read Paper →
Computer Science Preprint PDF DOI

Age Optimal Sampling for Unreliable Channels under Unknown Channel Statistics

Hongyi He, Haoyue Tang, Jiayu Pan, Jintao Wang, Jian Song, Leandros Tassiulas · 2024

In this paper, we study a system in which a sensor forwards status updates to a receiver through an error-prone channel, while the receiver sends the transmission results back to the sensor via a reli…

Read Paper →
Computer Science Preprint PDF DOI

A Committee Based Optimal Asynchronous Byzantine Agreement Protocol W.P. 1

Nasit S Sony, Xianzhong Ding, Mukesh Singhal · 2024

Multi-valued Byzantine agreement (MVBA) protocols are essential for atomic broadcast and fault-tolerant state machine replication in asynchronous networks. Despite advances, challenges persist in opti…

Read Paper →
Computer Science Preprint PDF DOI

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates

Matthias Kaul, Matthias Mnich, Hendrik Molter · 2024

We study the fundamental scheduling problem $1\mid r_j\mid\sum w_j U_j$: schedule a set of $n$ jobs with weights, processing times, release dates, and due dates on a single machine, such that each job…

Read Paper →
Computer Science Preprint PDF DOI

von Neumann and Newman Pokers with Finite Decks

Tipaluck Krityakierne, Thotsaporn Aek Thanatipanonda, Doron Zeilberger · 2024

John von Neumann studied a simplified version of poker where the "deck" consists of infinitely many cards, in fact, all real numbers between $0$ and $1$. We harness the power of computation, both nume…

Read Paper →
Computer Science Preprint PDF DOI

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs

Kou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane, Srinivasa Rao Satti · 2024

Tree covering is a technique for decomposing a tree into smaller-sized trees with desirable properties, and has been employed in various succinct data structures. However, significant hurdles stand in…

Read Paper →
Computer Science Preprint PDF DOI

A Payoff-Based Policy Gradient Method in Stochastic Games with Long-Run Average Payoffs

Junyue Zhang, Yifen Mu · 2024

Despite the significant potential for various applications, stochastic games with long-run average payoffs have received limited scholarly attention, particularly concerning the development of learnin…

Read Paper →
Computer Science Preprint PDF DOI

Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines

Klaus Heeger, Hendrik Molter · 2024

In this work, we study the computational (parameterized) complexity of $P \mid r_j, p_j=p \mid \sum_j w_j U_j$. Here, we are given $m$ identical parallel machines and $n$ jobs with equal processing ti…

Read Paper →
Computer Science Preprint PDF DOI

Tight Bounds for Sorting Under Partial Information

Ivor van der Hoog, Daniel Rutschmann · 2024

Sorting has a natural generalization where the input consists of: (1) a ground set $X$ of size $n$, (2) a partial oracle $O_P$ specifying some fixed partial order $P$ on $X$ and (3) a linear oracle $O…

Read Paper →
Computer Science Preprint PDF DOI

Experi\^encias, Resultados e Reflex\~oes a partir do Gerenciamento de experimentos no Mundo Real com FANETs e VANTs -- Vers\~ao Estendida

Bruno Jose Olivieri de Souza, markus Endler · 2024

In the research on FANETs (Flying Ad-Hoc Networks) and distributed coordination of UAVs (Unmanned Aerial Vehicles), also known as drones, there are many studies that validate their proposals through s…

Read Paper →
Computer Science Preprint PDF DOI

Deterministic Cache-Oblivious Funnelselect

Gerth St{o}lting Brodal, Sebastian Wild · 2024

In the multiple-selection problem one is given an unsorted array $S$ of $N$ elements and an array of $q$ query ranks $r_1<\cdots<r_q$, and the task is to return, in sorted order, the $q$ elements in $…

Read Paper →
Page 1 of 6 Next →