#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1979

2016

- This year (0)
- Last 5 years (2)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

This paper points to an abnormal phenomena of comparator networks. For most key processing problems (such as sorting, merging or insertion) the smaller the input size the easier the problem. Surprisingly, this is not the case for Bitonic sorting. Namely, the minimal depth of a comparator network that sorts all Bitonic sequences of n keys is not monotonic in… (More)

- Tamir Levi, Ami Litman
- Theory of Computing Systems
- 2010

The 0-1 Principle of Knuth and its many variants are well-known in the context of comparator networks. However, the comparator model is not the strongest model of computation obeying such principles. This paper studies another natural model of computation, the Min-Max model, that obeys all known 0-1 Principles. More important, it is the strongest model… (More)

- Guy Even, Tamir Levi, Ami Litman
- Theor. Comput. Sci.
- 2007

A set of input vectors S is conclusive for a certain functionality if, for every comparator network, correct functionality for all input vectors is implied by correct functionality for all vectors in S. We consider four functionalities of comparator networks: sorting, merging, sorting of bitonic vectors, and halving. For each of these functionalities, we… (More)

- Tamir Levi, Ami Litman
- Theor. Comput. Sci.
- 2009

This work studies comparator networks in which several of the outputs are accelerated. That is, they are generated much faster than the other outputs, and this without hindering the other outputs. We study this acceleration in the context of merging networks and sorting networks. The paper presents a new merging technique, the Tri-section technique, that… (More)

- Kiyoshi Sato, K-I Yamamura, +116 authors Diego J. Lizcano
- Population Ecology
- 2012

Akçakaya, R. (3) Ayres, M. P. Bjørnstad, O. N. (2) Ettterson, J. (2) Ezoe, H. Guillot, G. Hanski, I. Hori, M. Hsieh, C.-H. (2) Itino, T. (2) Jovani, R. (2) Kameyama, Y. (3) Kelly, D. Kenta, T. Kishida, O. (4) Kondoh, M. Lambin, X. (2) Liebhold, A. M. (4) Maki, M. (2) Matsuura, K. (3) Miki, T. (2) Miyatake, T. (2) Morita, K. (2) Nakaoka, M. (4) Ovaskainen,… (More)

- Filippo Grassia, Tadayoshi Kohno, Tamir Levi
- Journal of physiology, Paris
- 2016

This study explores the feasibility of stochastic neuron simulation in digital systems (FPGA), which realizes an implementation of a two-dimensional neuron model. The stochasticity is added by a source of current noise in the silicon neuron using an Ornstein-Uhlenbeck process. This approach uses digital computation to emulate individual neuron behavior… (More)

- Tamir Levi
- Nursing
- 1979

- Tamir Levi
- Nursing
- 1979

- Tamir Levi
- 2007

This paper presents the neuron-level integration of a complete system that emulates spiking neural networks. Analog ASICs are used for the computation of neurons activity while the connectivity between these neurons is digitally controlled. One ASIC integrates several biologically realistic neurons, following the Hodgkin-Huxley formalism, where mathematical… (More)

- Tamir Levi, Ami Litman
- Theor. Comput. Sci.
- 2011

Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 dlog(n)e − blog(n)c.