1.7k citations
- Technion – Israel Institute of TechnologyIL151 papers
- Oranim Academic College of EducationIL134 papers
- Tel Aviv UniversityIL55 papers
- Heidelberg UniversityDE36 papers
- Carmel (Israel)IL29 papers
- Columbia UniversityUS25 papers
- Massachusetts Institute of TechnologyUS25 papers
- National Research University Higher School of EconomicsRU25 papers
- University of AmsterdamNL22 papers
- Hebrew University of JerusalemIL21 papers
- Princeton UniversityUS21 papers
- Centre National de la Recherche ScientifiqueFR20 papers
47 papers · 1 filter
Accommodating Retrocausality with Free Will
Yakir Aharonov, Eliahu Cohen, Tomer Shushi
Retrocausal models of QM add further weight to the conflict between causality and the possible existence of free will. We analyze a simple closed causal loop ensuing from the inter…
Covers, envelopes, and cotorsion theories in locally presentable abelian categories and contramodule categories
Leonid Positselski, Jiri Rosicky
We prove general results about completeness of cotorsion theories and existence of covers and envelopes in locally presentable abelian categories, extending the well-established th…
Minimum Cut of Directed Planar Graphs in O(nloglogn) Time
Shay Mozes, Cyril Nikolaev, Yahav Nussbaum +1
We give an time algorithm for computing the minimum cut (or equivalently, the shortest cycle) of a weighted directed planar graph. This improves the previous fas…
New Douglas-Rachford algorithmic structures and their convergence analyses
Yair Censor, Rafiq Mansour
In this paper we study new algorithmic structures with Douglas- Rachford (DR) operators to solve convex feasibility problems. We propose to embed the basic two-set-DR algorithmic o…
Cliques in the union of -free graphs
Abeer Othman, Eli Berger
Let and be two simple graphs with vertex set , and let be the simple graph with vertex set , in which two vertices are adjacent if they are adjacent in at le…
Expressiveness and Understandability Considerations of Hierarchy in Declarative Business Process Models
Stefan Zugal, Pnina Soffer, Jakob Pinggera +1
Hierarchy has widely been recognized as a viable approach to deal with the complexity of conceptual models. For instance, in declarative business process models, hierarchy is reali…