We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be significantly harder for testing than other properties studied in the orientation model. We show a non-constant lower bound on the query complexity of 2-sided tests and a linear lower bound on the query complexity of 1...

This Chapter provides a survey of the economics literature on multi-sided platforms with particular focus on competition policy issues, including market definition, mergers, monopolization, and coordinated behavior. It provides a survey of the general industrial organization theory of multi-sided platforms and then considers various issues concerning the application of antitrust analysis to mul...

We prove that a Lie nilpotent one-sided ideal of an associative ring R is contained in a Lie solvable two-sided ideal of R. An estimation of derived length of such Lie solvable ideal is obtained depending on the class of Lie nilpotency of the Lie nilpotent one-sided ideal of R. One-sided Lie nilpotent ideals contained in ideals generated by commutators of the form [. . . [[r1, r2], . . .], rn−1...

There is a growing appreciation for the adverse long-term impact of right-sided valvular dysfunction in patients with congenital heart disease. Although right-sided valvular stenosis and/or regurgitation is often better tolerated than left-sided valvular dysfunction in the short and intermediate term, the long-term consequences are numerous and include, but are not limited to, arrhythmias, hear...

We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be significantly harder for testing than other properties studied in the orientation model. We show a superconstant lower bound on the query complexity of 2-sided tests and a linear lower bound on the query complexity of ...

We present output sensitive techniques for the generalized reporting versions of the planar range maxima problem and the planar range convex hull problem. Our solutions are in the pointer machine model, for orthogonal range queries on a static point set. We solve the planar range maxima problem for two-sided, three-sided and four-sided queries. We achieve a query time of O(log n+c) using O(n) s...

In order to investigate differences in the effects of spatial attention between the left visual field (LVF) and the right visual field (RVF), we employed a full/poor attention paradigm using stimuli presented in the LVF vs. RVF. In addition, to investigate differences in the effects of spatial attention between the dorsal and ventral processing streams, we obtained motion thresholds (motion coh...