Found 758 papers in total

2017,

A prominent tool in many problems involving metric spaces is a notion of randomized...

2017,

We investigate the parameterized complexity of Generalized Red Blue Set Cover (...

2017,

Consider a setting where possibly sensitive information sent over a path in a network...

Exact Sampling Algorithms for Latin Squares and Sudoku Matrices via Probabilistic Divide-and-Conquer

2017,

We provide several algorithms for the exact, uniform random sampling of Latin squares...

2017,

In several applications of automatic diagnosis and active learning, a central problem...

2017,

A team of k mobile robots is deployed on a weighted graph whose edge weights represent...

2017,

This paper presents a quantum algorithm for triangle finding over sparse graphs that...

2017,

In this paper we consider substrings of an unrooted edge‐labeled tree, which...

2017,

In this paper, we study the approximability of the minimum rainbow subgraph (MRS)...

2017,

String kernels are typically used to compare genome‐scale sequences whose...

2017,

In this paper we investigate the top‐ k ‐selection problem, i.e. to...

2017,

A secret sharing scheme is non‐perfect if some subsets of players that cannot...

2017,

An obfuscator O is Virtual Grey Box (VGB) for a class C of circuits if, for any C...

2017,

We initiate a study of the security of cryptographic primitives in the presence of...

2017,

Non‐interactive zero‐knowledge proofs of knowledge for general NP...

2017,

Random number generators (RNGs) play a crucial role in many cryptographic schemes and...

2017,

In this work, we show how to use indistinguishability obfuscation to build multiparty...

Self-Bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications

2017,

A self‐bilinear map is a bilinear map where the domain and target groups are...

2017,

The notion of differing‐inputs obfuscation (diO) was introduced by Barak et al....

2017,

We consider the Combinatorial RNA Design problem , a minimal instance of RNA design...

2017,

We characterize the best possible trade‐off achievable when optimizing the...

2017,

This paper considers enumeration of substring equivalence classes introduced by Blumer...

2017,

Caching (also known as paging ) is a classical problem concerning page replacement...

2017,

We study the convex‐hull problem in a probabilistic setting, motivated by the...

Papers per page:

© Copyright 2018 IFORS - The International Federation of Operational Research Societies.