175 citations
- Oranim Academic College of EducationIL25 papers
- Technion – Israel Institute of TechnologyIL13 papers
- Carmel (Israel)IL4 papers
- Nankai UniversityCN4 papers
- Centre National de la Recherche ScientifiqueFR3 papers
- Dalian Maritime UniversityCN3 papers
- Hebrew University of JerusalemIL3 papers
- Centrum Wiskunde & InformaticaNL2 papers
- Georgia Institute of TechnologyUS2 papers
- Royal Holloway University of LondonGB2 papers
- University of IcelandIS2 papers
- University of Notre DameUS2 papers
15 papers · 1 filter
Computads and Multitopic Sets
Victor Harnik, Michael Makkai, Marek Zawadowski
We compare computads with multitopic sets. Both these kinds of structures have n-dimensional objects (called n-cells and n-pasting diagrams, respectively). The computads form a sub…
Universal pointwise selection rule in multivariate function estimation
Alexander Goldenshluger, Oleg Lepski
In this paper, we study the problem of pointwise estimation of a multivariate function. We develop a general pointwise estimation procedure that is based on selection of estimators…
On central extensions and definably compact groups in o-minimal structures
Ehud Hrushovski, Ya'acov Peterzil, Anand Pillay
We prove several structural results on definably compact groups G in o-minimal expansions of real closed fields, such as (i) G is definably an almost direct product of a semisimple…
Symmetric Schroder paths and restricted involutions
Eva Y. P. Deng, Mark Dukes, Toufik Mansour +1
Let be the set of permutations in the symmetric group with prefix 12. This paper concerns the enumeration of involutions which avoid the set of patterns . We prese…
Peer-to-Peer Secure Multi-Party Numerical Computation
Danny Bickson, Genia Bezman, Danny Dolev +1
We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collabora…
Single source shortest paths in -minor free graphs
Raphael Yuster
We present an algorithm for the Single Source Shortest Paths (SSSP) problem in \emph{-minor free} graphs. For every fixed , if is a graph with vertices having integer…