Latest in cs.ds

total 29512took 0.12s
On determinantal curves and complexified phase-lock areas in a model of Josephson junctionAug 22 2019The paper deals with a three-parameter family of special double confluent Heun equations that was introduced and studied by V.M.Buchstaber and S.I.Tertychnyi as an equivalent presentation of a model of overdamped Josephson junction in superconductivity. ... More
Two Decades of Network Science as seen through the co-authorship network of network scientistsAug 22 2019Complex networks have attracted a great deal of research interest in the last two decades since Watts & Strogatz, Barab\'asi & Albert and Girvan & Newman published their highly-cited seminal papers on small-world networks, on scale-free networks and on ... More
On the Structural Properties of Social Networks and their Measurement-calibrated Synthetic CounterpartsAug 22 2019Data-driven analysis of large social networks has attracted a great deal of research interest. In this paper, we investigate 120 real social networks and their measurement-calibrated synthetic counterparts generated by four well-known network models. ... More
Covering convex bodies and the Closest Vector ProblemAug 22 2019We present algorithms for the $(1+\epsilon)$-approximate version of the closest vector problem for certain norms. The currently fastest algorithm (Dadush and Kun 2016) for general norms has running time of $2^{O(n)} (1/\epsilon)^n$. We improve this substantially ... More
Non-abelian Hodge Theory and Related TopicsAug 22 2019This paper is a survey aimed on the introduction of non-abelian Hodge theory that gives the correspondence between flat bundles and Higgs bundles, and some topics arising from this theory, especially some recent developments on the study of the relevant ... More
A Nonseparable Invariant Extension of Lebesgue Measure -- A Generalized and Abstract ApproachAug 22 2019Here using some methods of combinatorial set theory, particularly the ones related to the construction of independent families of sets and some modified version of the notion of small sets originally introduced by Riecan, Riecan and Neubrunn, we give ... More
Thermodynamic formalism for coarse expanding dynamical systemsAug 22 2019We consider a class of dynamical systems which we call weakly coarse expanding, which generalize to the postcritically infinite case expanding Thurston maps as discussed by Bonk-Meyer and are closely related to coarse expanding conformal systems as defined ... More
Interactive Duplicate Search in Software DocumentationAug 22 2019Various software features such as classes, methods, requirements, and tests often have similar functionality. This can lead to emergence of duplicates in their descriptive documentation. Uncontrolled duplicates created via copy/paste hinder the process ... More
Classification of flat pencils of foliations on compact complex surfacesAug 22 2019Related to the classification of regular foliations in a complex algebraic surface, we address the problem of classifying the complex surfaces which admit a flat pencil of foliations. On this matter, a classification of flat pencils which admit foliations ... More
The agreement distance of unrooted phylogenetic networksAug 22 2019A rearrangement operation makes a small graph-theoretical change to a phylogenetic network to transform it into another one. For unrooted phylogenetic trees and networks, popular rearrangement operations are tree bisection and reconnection (TBR) and prune ... More
Multi-level Graph Drawing using Infomap ClusteringAug 22 2019Infomap clustering finds the community structures that minimize the expected description length of a random walk trajectory; algorithms for infomap clustering run fast in practice for large graphs. In this paper we leverage the effectiveness of Infomap ... More
Engineering Faster Sorters for Small Sets of ItemsAug 21 2019Sorting a set of items is a task that can be useful by itself or as a building block for more complex operations. The more sophisticated and fast sorting algorithms become asymptotically, the less efficient they are for small sets of items due to large ... More
Generalized Metric Repair on GraphsAug 21 2019Many modern data analysis algorithms either assume or are considerably more efficient if the distances between the data points satisfy a metric. These algorithms include metric learning, clustering, and dimension reduction. As real data sets are noisy, ... More
Spectral estimates for saddle point matrices arising in weak constraint four-dimensional variational data assimilationAug 21 2019We consider the large-sparse symmetric linear systems of equations that arise in the solution of weak constraint four-dimensional variational data assimilation. These systems can be written as saddle point systems with a 3x3 block structure but block ... More
Fractional heat semigroups on metric measure spaces with finite densities and applications to fractional dissipative equationsAug 21 2019Let $(\mathbb M, d,\mu)$ be a metric measure space with upper and lower densities: $$ \begin{cases} |||\mu|||_{\beta}:=\sup_{(x,r)\in \mathbb M\times(0,\infty)} \mu(B(x,r))r^{-\beta}<\infty;\\ |||\mu|||_{\beta^{\star}}:=\inf_{(x,r)\in \mathbb M\times(0,\infty)} ... More
A Quality Metric for Visualization of Clusters in GraphsAug 21 2019Traditionally, graph quality metrics focus on readability, but recent studies show the need for metrics which are more specific to the discovery of patterns in graphs. Cluster analysis is a popular task within graph analysis, yet there is no metric yet ... More
On the trend to global equilibrium for Kuramoto OscillatorsAug 21 2019In this paper, we study the convergence to the stable equilibrium for Kuramoto oscillators. Specifically, we derive estimates on the rate of convergence to the global equilibrium for solutions of the Kuramoto-Sakaguchi equation in a large coupling strength ... More
Optimization Bounds from the Branching DualAug 20 2019We present a general method for obtaining strong bounds for discrete optimization problems that is based on a concept of branching duality. It can be applied when no useful integer programming model is available, and we illustrate this with the minimum ... More
Expansion properties for finite subdivision rules IIAug 20 2019We prove that every sufficiently large iterate of a Thurston map which is not doubly covered by a torus endomorphism and which does not have a Levy cycle is isotopic to the subdivision map of a finite subdivision rule. We determine which Thurston maps ... More
Iterated traces in bicategories and Lefschetz theoremsAug 20 2019While not obvious from its initial motivation in linear algebra, there are many context where iterated traces can be defined. In this paper we prove a very general theorem about iterated 2-categorical traces. We show that many Lefschetz-type theorems ... More
PPT: New Low Complexity Deterministic Primality Tests Leveraging Explicit and Implicit Non-Residues. A Set of Three Companion ManuscriptsAug 20 2019In this set of three companion manuscripts/articles, we unveil our new results on primality testing and reveal new primality testing algorithms enabled by those results. The results have been classified (and referred to) as lemmas/corollaries/claims whenever ... More
An algorithm for destroying claws and diamondsAug 20 2019In the {Claw,Diamond}-Free Edge Deletion problem the input is a graph $G$ and an integer $k$, and the goal is to decide whether there is a set of edges of size at most $k$ such that removing the edges of the set from $G$ results a graph that does not ... More
Evacuation of equilateral triangles by mobile agents of limited communication rangeAug 20 2019We consider the problem of evacuating $k \geq 2$ mobile agents from a unit-sided equilateral triangle through an exit located at an unknown location on the perimeter of the triangle. The agents are initially located at the centroid of the triangle and ... More
Computing Stable Demers CartogramsAug 20 2019Aug 21 2019Cartograms are popular for visualizing numerical data for map regions. Maintaining correct adjacencies is a primary quality criterion for cartograms. When there are multiple data values per region (over time or different datasets) shown as animated or ... More
Computing Stable Demers CartogramsAug 20 2019Cartograms are popular for visualizing numerical data for map regions. Maintaining correct adjacencies is a primary quality criterion for cartograms. When there are multiple data values per region (over time or different datasets) shown as animated or ... More
Multiple backward Schramm--Loewner evolution and coupling with Gaussian free fieldAug 20 2019It is known that a backward Schramm--Loewner evolution (SLE) is coupled with a free boundary Gaussian free field (GFF) with boundary perturbation to give a conformal welding of a quantum surface. Motivated by a generalization of conformal welding for ... More
Improved Job sequencing Bounds from Decision DiagramsAug 19 2019We introduce a general method for relaxing decision diagrams that allows one to bound job sequencing problems by solving a Lagrangian dual problem on a relaxed diagram. We also provide guidelines for identifying problems for which this approach can result ... More
Digraphs are different: Why directionality matters in complex systemsAug 19 2019Many networks describing complex systems are directed: the interactions between elements are not symmetric. Recent work has shown that these networks can display properties such as trophic coherence or non-normality, which in turn affect stability, percolation ... More
A synthetic approach to Markov kernels, conditional independence, and theorems on sufficient statisticsAug 19 2019We develop Markov categories as a framework for synthetic probability and statistics, following work of Golubtsov as well as Cho and Jacobs. This means that we treat the following concepts in purely abstract categorical terms: conditioning and disintegration; ... More
A Game of Cops and Robbers on Graphs with Periodic Edge-ConnectivityAug 19 2019This paper considers a game in which a single cop and a single robber take turns moving along the edges of a given graph $G$. If there exists a strategy for the cop which enables it to be positioned at the same vertex as the robber eventually, then $G$ ... More
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree SequencesAug 19 2019As a partial answer to a question of Rao, a deterministic and customizable efficient algorithm is presented to test whether an arbitrary graphical degree sequence has a bipartite realization. The algorithm can be configured to run in polynomial time, ... More
Boomerang: Real-Time I/O Meets Legacy SystemsAug 19 2019This paper presents Boomerang, a system that integrates a legacy non-real-time OS with one that is customized for timing-sensitive tasks. A relatively small RTOS benefits from the pre-existing libraries, drivers and services of the legacy system. Additionally, ... More
A New Fast Unweighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path TreesAug 19 2019We present a new fast all-pairs shortest path algorithm for unweighted graphs. In breadth-first search which is said to representative and fast in unweighted graphs, the average number of accesses to adjacent vertices (expressed by {\alpha}) is about ... More
A New Fast Weighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path TreesAug 19 2019Recently we submitted a paper, whose title is A New Fast Unweighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees, to arXiv. This is related to unweighted graphs. This paper also presents a new fast all-pairs shortest ... More
WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover TrackAug 19 2019We present the winning solver of the PACE 2019 Implementation Challenge, Vertex Cover Track. The minimum vertex cover problem is one of a handful of problems for which kernelization---the repeated reducing of the input size via data reduction rules---is ... More
WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover TrackAug 19 2019Aug 20 2019We present the winning solver of the PACE 2019 Implementation Challenge, Vertex Cover Track. The minimum vertex cover problem is one of a handful of problems for which kernelization---the repeated reducing of the input size via data reduction rules---is ... More
Time Delay in the Swing Equation: A Variety of BifurcationsAug 19 2019The present paper addresses the swing equation with additional delayed damping as an example for pendulum-like systems. In this context, it is proved that recurring sub- and supercritical Hopf bifurcations occur if time delay is increased. To this end, ... More
On bin packing with clustering and bin packing with delaysAug 19 2019We continue the study of two recently introduced bin packing type problems, called bin packing with clustering, and online bin packing with delays. A bin packing input consists of items of sizes not larger than 1, and the goal is to partition or pack ... More
Quantum algorithms for Second-Order Cone Programming and Support Vector MachinesAug 19 2019Second order cone programs (SOCPs) are a class of structured convex optimization problems that generalize linear programs. We present a quantum algorithm for second order cone programs (SOCPs) based on a quantum variant of the interior point method. Our ... More
Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separatorsAug 19 2019In this work we consider balanced Schnyder woods for planar graphs, which are Schnyder woods where the number of incoming edges of each color at each vertex is balanced as much as possible. We provide a simple linear-time heuristic leading to obtain well ... More
Arbitrarily large $\mathcal{O}$-Morita Frobenius numbersAug 19 2019We construct blocks of finite groups with arbitrarily large $\mathcal{O}$-Morita Frobenius numbers. There are no known examples of two blocks defined over $\mathcal{O}$ that are not Morita equivalent but the corresponding blocks defined over $k$ are. ... More
Quantum Expectation-Maximization for Gaussian Mixture ModelsAug 19 2019The Expectation-Maximization (EM) algorithm is a fundamental tool in unsupervised machine learning. It is often used as an efficient way to solve Maximum Likelihood (ML) estimation problems, especially for models with latent variables. It is also the ... More
A Computational Model for Tensor Core UnitsAug 19 2019To respond to the need of efficient training and inference of deep neural networks, a pletora of domain-specific hardware architectures have been introduced, such as Google Tensor Processing Units and NVIDIA Tensor Cores. A common feature of these architectures ... More
Mitigating Multi-Stage Cascading Failure by Reinforcement LearningAug 19 2019This paper proposes a cascading failure mitigation strategy based on Reinforcement Learning (RL) method. Firstly, the principles of RL are introduced. Then, the Multi-Stage Cascading Failure (MSCF) problem is presented and its challenges are investigated. ... More
The Landscape of Minimum Label Cut (Hedge Connectivity) ProblemAug 19 2019Minimum Label Cut (or Hedge Connectivity) problem is defined as follows: given an undirected graph $G=(V, E)$ with $n$ vertices and $m$ edges, in which, each edge is labeled (with one or multiple labels) from a label set $L=\{\ell_1,\ell_2, ..., \ell_{|L|}\}$, ... More
The Landscape of Minimum Label Cut (Hedge Connectivity) ProblemAug 19 2019Aug 20 2019Minimum Label Cut (or Hedge Connectivity) problem is defined as follows: given an undirected graph $G=(V, E)$ with $n$ vertices and $m$ edges, in which, each edge is labeled (with one or multiple labels) from a label set $L=\{\ell_1,\ell_2, ..., \ell_{|L|}\}$, ... More
The Runtime of the Compact Genetic Algorithm on Jump FunctionsAug 18 2019In the first and so far only mathematical runtime analysis of an estimation-of-distribution algorithm (EDA) on a multimodal problem, Hasen\"ohrl and Sutton (GECCO 2018) showed for any $k = o(n)$ that the compact genetic algorithm (cGA) with any hypothetical ... More
A New k-Shortest Path Search Approach based on Graph ReductionAug 18 2019We present a new approach called GR (Graph Reduction) algorithm for searching loop-less k-shortest paths (1st to k-th shortest paths) in a graph based on graph reduction. Let a source vertex and a target vertex of k-shortest paths be v_s and v_t respectively. ... More
The smallest grammar problem revisitedAug 18 2019In a seminal paper of Charikar et al. on the smallest grammar problem, the authors derive upper and lower bounds on the approximation ratios for several grammar-based compressors, but in all cases there is a gap between the lower and upper bound. Here ... More
The Maximum Common Subgraph Problem: A Portfolio ApproachAug 18 2019The Maximum Common Subgraph is a computationally challenging problem with countless practical applications. Even if it has been long proven NP-hard, its importance still motivates searching for exact solutions. This work starts by discussing the possibility ... More
On a progressive and iterative approximation method with memory for least square fittingAug 18 2019In this paper, we present a progressive and iterative approximation method with memory for least square fitting(MLSPIA). It adjusts the control points and the weighted sums iteratively to construct a series of fitting curves (surfaces) with three weights. ... More
On a progressive and iterative approximation method with memory for least square fittingAug 18 2019Aug 21 2019In this paper, we present a progressive and iterative approximation method with memory for least square fitting(MLSPIA). It adjusts the control points and the weighted sums iteratively to construct a series of fitting curves (surfaces) with three weights. ... More
Dynamics of neural fields with exponential temporal kernelAug 17 2019In this paper, we consider the standard neural field equation with an exponential temporal kernel. We analyze the time-independent (static) and time-dependent (dynamic) bifurcations of the equilibrium solution and the emerging spatio-temporal wave patterns. ... More
Revisiting the Graph Isomorphism Problem with Semidefinite ProgrammingAug 17 2019We present a new algorithm for the graph isomorphism problem which solves an equivalent maximum clique formulation via semidefinite programming. Following previous results, we show that graph isomorphism is equivalent to determining whether an auxiliary ... More
Comparison-Based Indexing From First PrinciplesAug 17 2019Basic assumptions about comparison-based indexing are laid down and a general design space is derived from these. An index structure spanning this design space (the sprawl) is described, along with an associated family of partitioning predicates, or regions ... More
The stable set problem in graphs with bounded genus and bounded odd cycle packing numberAug 17 2019Consider the family of graphs without $ k $ node-disjoint odd cycles, where $ k $ is a constant. Determining the complexity of the stable set problem for such graphs $ G $ is a long-standing problem. We give a polynomial-time algorithm for the case that ... More
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local LemmaAug 17 2019Aug 20 2019The Lov\'{a}sz Local Lemma (LLL) says that, given a set of bad events that depend on the values of some random variables and where each event happens with probability at most $p$ and depends on at most $d$ other events, there is an assignment of the variables ... More
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovasz Local LemmaAug 17 2019The Lov\'{a}sz Local Lemma (LLL) says that, given a set of bad events that depend on the values of some random variables and where each event happens with probability at most $p$ and depends on at most $d$ other events, there is an assignment of the variables ... More
Generalized potential gamesAug 17 2019In this paper, we introduce a notion of generalized potential games that is inspired by a newly developed theory on generalized gradient flows. More precisely, a game is called generalized potential if the simultaneous gradient of the loss functions is ... More
Discrete and Fast Fourier Transform Made ClearAug 17 2019Fast Fourier transform was included in the Top 10 Algorithms of 20th Century by Computing in Science & Engineering. In this paper, we provide a new simple derivation of both the discrete Fourier transform and fast Fourier transform by means of elementary ... More
Approximation Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with a Size ConstraintAug 17 2019The stochastic greedy algorithm (SG) is a randomized version of the greedy algorithm for submodular maximization with a size constraint. SG is highly practical since it is fast, delivers high empirical performance, and is easy to implement. However, its ... More
Partially hyperbolic diffeomorphisms homotopic to the identity in dimension 3Aug 17 2019We study partially hyperbolic diffeomorphisms homotopic to the identity in 3-manifolds. Under a general minimality condition, we show a dichotomy for the dynamics of the (branching) foliations in the universal cover. This allows us to give a full classification ... More
PAStime: Progress-aware Scheduling for Time-critical ComputingAug 17 2019Over-estimation of worst-case execution times (WCETs) of real-time tasks leads to poor resource utilization. In a mixed-criticality system (MCS), the over-provisioning of CPU time to accommodate the WCETs of highly critical tasks can lead to degraded ... More
Report on workflow analysis for specific LAM applicationsAug 16 2019This document is one of the deliverable reports created for the ESCAPE project. ESCAPE stands for Energy-efficient Scalable Algorithms for Weather Prediction at Exascale. The project develops world-class, extreme-scale computing capabilities for European ... More
Report on energy-efficiency evaluation of several NWP model configurationsAug 16 2019This document is one of the deliverable reports created for the ESCAPE project. ESCAPE stands for Energy-efficient Scalable Algorithms for Weather Prediction at Exascale. The project develops world-class, extreme-scale computing capabilities for European ... More
Projections of achievable performance for Weather & Climate Dwarfs, and for entire NWP applications, on hybrid architecturesAug 16 2019This document is one of the deliverable reports created for the ESCAPE project. ESCAPE stands for Energy-efficient Scalable Algorithms for Weather Prediction at Exascale. The project develops world-class, extreme-scale computing capabilities for European ... More
Performance report and optimized implementations of Weather & Climate dwarfs on multi-node systemsAug 16 2019This document is one of the deliverable reports created for the ESCAPE project. ESCAPE stands for Energy-efficient Scalable Algorithms for Weather Prediction at Exascale. The project develops world-class, extreme-scale computing capabilities for European ... More
Performance report and optimized implementation of Weather & Climate Dwarfs on GPU, MIC and Optalysys Optical ProcessorAug 16 2019This document is one of the deliverable reports created for the ESCAPE project. ESCAPE stands for Energy-efficient Scalable Algorithms for Weather Prediction at Exascale. The project develops world-class, extreme-scale computing capabilities for European ... More
Recommendations and specifications for data scope analysis toolsAug 16 2019This document is one of the deliverable reports created for the ESCAPE project. ESCAPE stands for Energy-efficient Scalable Algorithms for Weather Prediction at Exascale. The project develops world-class, extreme-scale computing capabilities for European ... More
Low-rank approximation in the Frobenius norm by column and row subset selectionAug 16 2019A CUR approximation of a matrix $A$ is a particular type of low-rank approximation $A \approx C U R$, where $C$ and $R$ consist of columns and rows of $A$, respectively. One way to obtain such an approximation is to apply column subset selection to $A$ ... More
Report on the performance portability demonstrated for the relevant Weather & Climate DwarfsAug 16 2019This document is one of the deliverable reports created for the ESCAPE project. ESCAPE stands for Energy-efficient Scalable Algorithms for Weather Prediction at Exascale. The project develops world-class, extreme-scale computing capabilities for European ... More
Additional key features required for different directives based porting approachesAug 16 2019This document is one of the deliverable reports created for the ESCAPE project. ESCAPE stands for Energy-efficient Scalable Algorithms for Weather Prediction at Exascale. The project develops world-class, extreme-scale computing capabilities for European ... More
Development of Atlas, a flexible data structure frameworkAug 16 2019This document is one of the deliverable reports created for the ESCAPE project. ESCAPE stands for Energy-efficient Scalable Algorithms for Weather Prediction at Exascale. The project develops world-class, extreme-scale computing capabilities for European ... More
An algorithm for real and complex rational minimax approximationAug 16 2019Rational minimax approximation of real functions on real intervals is an established topic, but when it comes to complex functions or domains, there appear to be no algorithms currently in use. Such a method is introduced here, the {\em AAA-Lawson algorithm,} ... More
Batch 2: Definition of novel Weather & Climate DwarfsAug 16 2019This document is one of the deliverable reports created for the ESCAPE project. ESCAPE stands for Energy-efficient Scalable Algorithms for Weather Prediction at Exascale. The project develops world-class, extreme-scale computing capabilities for European ... More
LaserTank is NP-completeAug 16 2019We show that the classical game LaserTank is $\mathrm{NP}$-complete, even when the tank movement is restricted to a single column and the only blocks appearing on the board are mirrors and solid blocks. We show this by reducing $3$-SAT instances to LaserTank ... More
Batch 1: Definition of several Weather & Climate DwarfsAug 16 2019This document is one of the deliverable reports created for the ESCAPE project. ESCAPE stands for Energy-efficient Scalable Algorithms for Weather Prediction at Exascale. The project develops world-class, extreme-scale computing capabilities for European ... More
Efficient Online String Matching Based on Characters Distance Text SamplingAug 16 2019Searching for all occurrences of a pattern in a text is a fundamental problem in computer science with applications in many other fields, like natural language processing, information retrieval and computational biology. Sampled string matching is an ... More
Sum-Essential Graphs of ModulesAug 16 2019The sum-essential graph $ \mathcal{S}_R(M) $ of a left $R$-module $M$ is a graph whose vertices are all nontrivial submodules of $M$ and two distinct submodules are adjacent iff their sum is an essential submodule of $M$. Properties of the graph $\mathcal{S}_R(M)$ ... More
Matrix Lie Maps and Neural Networks for Solving Differential EquationsAug 16 2019The coincidence between polynomial neural networks and matrix Lie maps is discussed in the article. The matrix form of Lie transform is an approximation of the general solution of the nonlinear system of ordinary differential equations. It can be used ... More
Distributed Edge Partitioning for Trillion-edge GraphsAug 16 2019We propose Distributed Neighbor Expansion (Distributed NE), a parallel and distributed edge partitioning method that can scale to trillion-edge graphs while providing high partitioning quality. Distributed NE is based on a new heuristic, called parallel ... More
Memory-Efficient Object-Oriented Programming on GPUsAug 16 2019Object-oriented programming is often regarded as too inefficient for high-performance computing (HPC), despite the fact that many important HPC problems have an inherent object structure. Our goal is to bring efficient, object-oriented programming to ... More
Univalent Polynomials and Hubbard TreesAug 16 2019We study rational functions $f$ of degree $d$, univalent in the exterior unit disc, with $f(\mathbb{T})$ having the maximal number of cusps ($d+1$) and double points $(d-2)$. We introduce a bi-angled tree associated to any such $f$. It is proven that ... More
Invariant synchrony subspaces of sets of matricesAug 15 2019A synchrony subspace of R^n is defined by setting certain components of the vectors equal according to an equivalence relation. Synchrony subspaces invariant under a given set of square matrices form a lattice. Applications of these invariant synchrony ... More
Homotopy height, grid-major height and graph-drawing heightAug 15 2019It is well-known that both the pathwidth and the outer-planarity of a graph can be used to obtain lower bounds on the height of a planar straight-line drawing of a graph. But both bounds fall short for some graphs. In this paper, we consider two other ... More
Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-StabilizationAug 15 2019In the distributed backup-placement problem each node of a network has to select one neighbor, such that the maximum number of nodes that make the same selection is minimized. This is a natural relaxation of the perfect matching problem, in which each ... More
Normal Forms for Manifolds of Normally Hyperbolic Singularities and Asymptotic Properties of Nearby TransitionsAug 15 2019This paper contains theory on two related topics relevant to manifolds of normally hyperbolic singularities. First, theorems on the formal and $ C^k $ normal forms for these objects are proved. Then, the theorems are applied to give asymptotic properties ... More
Lifting recursive counterexamples to higher-order arithmeticAug 15 2019In classical computability theory, a recursive counterexample to a theorem shows that the latter does not hold when restricted to computable objects. These counterexamples are highly useful in the Reverse Mathematics program, where the aim of the latter ... More
On volume preserving almost Anosov flowsAug 15 2019The purpose of this paper is to establish limit laws for volume preserving almost Anosov flows on $3$-three manifolds having a neutral periodic of cubic saddle type. In the process, we derive estimates for the Dulac maps for cubic neutral saddles in planar ... More
Tracking Paths in Planar GraphsAug 15 2019We consider the NP-complete problem of tracking paths in a graph, first introduced by Banik et. al. [3]. Given an undirected graph with a source $s$ and a destination $t$, find the smallest subset of vertices whose intersection with any $s-t$ path results ... More
"LOADS of Space": Local Order Agnosticism and Bit Flip Efficient Data Structure CodesAug 15 2019Algorithms, data structures, coding techniques, and other methods that reduce bit-flips are being sought to best utilize hardware where flipping bits is the dominating cost. Write efficient memories were introduced by Ahlswede and Zhang as a model for ... More
Resolvable Designs for Speeding up Distributed ComputingAug 14 2019Distributed computing frameworks such as MapReduce are often used to process large computational jobs. They operate by partitioning each job into smaller tasks executed on different servers. The servers also need to exchange intermediate values to complete ... More
C0-Stability for actions implies shadowing propertyAug 14 2019We will construct an action $\Phi$, C0 and C1-stable and we will prove that every C0-stable action acting in a manifold of dimensions greater or equal to two, have the shadowing property.
(Learned) Frequency Estimation Algorithms under Zipfian DistributionAug 14 2019The frequencies of the elements in a data stream are an important statistical measure and the task of estimating them arises in many applications within data analysis and machine learning. Two of the most popular algorithms for this problem, Count-Min ... More
Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval DataAug 14 2019We address the Interval Data Min-Max Regret 0-1 Integer Linear Programming problem (MMR-ILP), a variant of the 0-1 Integer Linear Programming problem where the objective function coefficients are uncertain. We solve MMR-ILP using a Benders-like Decomposition ... More
Sketched Representations and Orthogonal Planarity of Bounded Treewidth GraphsAug 14 2019Given a planar graph $G$ and an integer $b$, OrthogonalPlanarity is the problem of deciding whether $G$ admits an orthogonal drawing with at most $b$ bends in total. We show that OrthogonalPlanarity can be solved in polynomial time if $G$ has bounded ... More
Correlation Clustering with Same-Cluster Queries Bounded by Optimal CostAug 14 2019Several clustering frameworks with interactive (semi-supervised) queries have been studied in the past. Recently, clustering with same-cluster queries has become popular. An algorithm in this setting has access to an oracle with full knowledge of an optimal ... More
Fast Cartesian Tree MatchingAug 14 2019Cartesian tree matching is the problem of finding all substrings of a given text which have the same Cartesian trees as that of a given pattern. So far there is one linear-time solution for Cartesian tree matching, which is based on the KMP algorithm. ... More
Re-Pair In-PlaceAug 14 2019Re-Pair is a grammar compression scheme with favorably good compression rates. The computation of Re-Pair comes with the cost of maintaining large frequency tables, which makes it hard to compute Re-Pair on large scale data sets. As a solution for this ... More
An Extension of Discrete Lagrangian Descriptors for Unbounded MapsAug 13 2019Aug 16 2019In this paper we provide an extension for the method of Discrete Lagrangian Descriptors with the purpose of exploring the phase space of unbounded maps. The key idea is to construct a working definition, that builds on the original approach introduced ... More