As smartphone notifications increase, so does the effort required to handle them effectively. Previous research has proposed various notification management features, but empirical evidence regarding their efficacy remains sparse. In response, we ...

Graph Drawing aims to make graphs visually comprehensible while faithfully representing their structure. In layered drawings, each vertex is drawn on a horizontal line and edges are drawn as y-monotone curves. A key ingredient for constructing such ...

We consider the expander routing problem formulated by Ghaffari, Kuhn, and Su (PODC 2017), where the goal is to route all the tokens to their destinations given that each vertex is the source and the destination of at most deg(υ) tokens. They developed ...

The fixed control structure of deterministic algorithms renders their behavior traceable but not amenable to interactive exploration.

In the accompanying poster, we illustrate how the runs of a transition system simulating a family of algorithms form the ...

Prior research, primarily based on laboratory experiments of children and students, suggests that women might be more averse to competition than are men; women might, instead, be more inclined toward collaboration. Were these findings to generalize to ...

Mobile notifications, crucial to our daily activities and informational needs, are often undermined by insufficient management features. Previous research has suggested enhancements like automatic sorting, filtering, and categorization, but empirical ...

This work analyzes and parallelizes LearnedSort, the novel algorithm that sorts using machine learning models based on the cumulative distribution function. LearnedSort is analyzed under the lens of algorithms with predictions, and it is argued that ...

We examine the sorting role of broad-based equity pay using detailed employee-level data. We propose trust in management as an important characteristic over which equity pay sorts employees, as such pay typically leaves employees with concentrated ...

Sorting is an important operation in database query processing. Complex pipeline-breaking operators (e.g., aggregation and equi-join) become single-pass algorithms on sorted tables. Therefore, sort-based query processing is a popular method for FPGA-...

Dremel encoding is a well-established format for data storage in the context of cloud storage and data analytics. Given a schema, it allows the column-oriented storage of nested data such as JSON. As a column-oriented format, it naturally plays well with ...

We present comparison-based parallel algorithms for sorting n comparable items subject to comparison errors. We consider errors to occur according to a well-studied framework, where the comparison of two elements returns the wrong answer with a fixed ...

Semisort is a fundamental algorithmic primitive widely used in the design and analysis of efficient parallel algorithms. It takes input as an array of records and a function extracting a key per record, and reorders them so that records with equal keys ...

Assume that an $N$-bit sequence S of k numbers encoded as Elias gamma codes is given as input. We present space-efficient algorithms for sorting, dense ranking and competitive ranking on S in the word RAM model with word size $\Omega (logN)$ bits. Our ...$\frac{}{}$$$$$$$$$${}_{}$$$

We present a three-party sorting protocol secure against passive and active adversaries in the honest majority setting. The protocol can be easily combined with other secure protocols which work on shared data, and thus enable different data analysis ...

Ailon et al. [SICOMP’11] proposed self-improving algorithms for sorting and Delaunay triangulation (DT) when the input instances x₁, ... , x_n follow some unknown product distribution. That is, x_i is drawn independently from a fixed unknown distribution 𝒟_...

Sorting is a fundamental operation in software systems. An example for that is a prepossessing phase before executing analytics operations.

Persistent memory (PM) is a nonvolatile device with low latency and byte-addressable access. Our experiments used ...

Much work already exists on algorithm visualization-the graphical representation of an algorithm's behavior-and its benefits for student learning. Visualization, however, offers limited benefit for students with visual impairments. This paper explores ...

The binary-forking model is a parallel computation model, formally defined by Blelloch et al., in which a thread can fork a concurrent child thread, recursively and asynchronously. The model incurs a cost of Θ(łog n) to spawn or synchronize n tasks or ...

FPGA technology has introduced new ways to accelerate database query processing, that often result in higher performance and energy efficiency. This is thanks to the unique architecture of FPGAs using reconfigurable resources to behave like an ...

Sorting plays a fundamental role in computer science. It has far reaching applications in database operations and data science tasks. An important class of sorting keys are strings and among all string sorting methods, radix sort is a simple but ...