Israel A. Wagner - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Multi-agent Cooperative Cleaning of Expanding DomainsYaniv Altshuler, Vladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein. ijrr, 30(8):1037-1071, 2011. [doi]

2009

Collaborative Exploration in Grid Domains - Constructive Conjecture of a Polynomial Time ComplexityYaniv Altshuler, Alfred M. Bruckstein, Israel A. Wagner. icinco 2009: 252-257

2008

2007

A Linear-Time Constant-Space Algorithm for the Boundary Fill ProblemVladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein. cj, 50(4):473-477, 2007. [doi]

2006

On Minimal Perimeter PolyminoesYaniv Altshuler, Vladimir Yanovski, Daniel Vainsencher, Israel A. Wagner, Alfred M. Bruckstein. dgci 2006: 17-28 [doi]

Swarm Intelligence - Searchers, Cleaners and HuntersYaniv Altshuler, Vladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein. In Nadia Nedjah, Luiza de Macedo Mourelle, editors, Swarm Intelligent Systems. Volume 26 of Studies in Computational Intelligence, pages 93-132, Springer, 2006. [doi]

Logic Gates as Repeaters (LGR) for Area-Efficient Timing OptimizationMichael Moreinis, Arkadiy Morgenshtein, Israel A. Wagner, Avinoam Kolodny. tvlsi, 14(11):1276-1281, 2006. [doi]

2004

2003

Discrete Bee Dance Algorithms for Pattern Formation on a GridNoam Gordon, Israel A. Wagner, Alfred M. Bruckstein. iat 2003: 545-549 [doi]

On-chip interconnect-aware design and modeling methodology, based on high bandwidth transmission line devicesDavid Goren, Michael Zelikson, Rachel Gordin, Israel A. Wagner, Anastasia Barger, Alon Amir, Betty Livshitz, Anatoly Sherman, Youri Tretiakov, Robert A. Groves, J. Park, Donald L. Jordan, Sue E. Strang, Raminderpal Singh, Carl E. Dickey, David L. Harame. dac 2003: 724-727 [doi]

Logic Gates as Repeaters (LGR) for Timing Optimization of SoC InterconnectsArkadiy Morgenshtein, Michael Moreinis, Israel A. Wagner, Avinoam Kolodny. vlsi 2003: 99-104

A Distributed Ant Algorithm for Efficiently Patrolling a NetworkVladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein. algorithmica, 37(3):165-186, 2003. [doi]

2002

2001

A Novel Method for Stochastic Nonlinearity Analysis of a CMOS Pipeline ADCDavid Goren, Eliyahu Shamsaev, Israel A. Wagner. dac 2001: 127-132 [doi]

From Ants to A(ge)nts: A Special Issue on Ant-RoboticsIsrael A. Wagner, Alfred M. Bruckstein. AMAI, 31(1-4):1-5, 2001.

Vertex-Ant-Walk - A robust method for efficient exploration of faulty graphsVladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein. AMAI, 31(1-4):99-112, 2001.

2000

ANTS: Agents on Networks, Trees, and SubgraphsIsrael A. Wagner, Michael Lindenbaum, Alfred M. Bruckstein. fgcs, 16(8):915-926, 2000. [doi]

MAC Versus PC: Determinism and Randomness as Complementary Approaches to Robotic Exploration of Continuous Unknown DomainsIsrael A. Wagner, Michael Lindenbaum, Alfred M. Bruckstein. ijrr, 19(1):12-31, 2000. [doi]

1998

Robotic Exploration, Brownian Motion and Electrical ResistanceIsrael A. Wagner, Michael Lindenbaum, Alfred M. Bruckstein. random 1998: 116-130 [doi]

Efficiently Searching a Graph by a Smell-Oriented Vertex ProcessIsrael A. Wagner, Michael Lindenbaum, Alfred M. Bruckstein. AMAI, 24(1-4):211-223, 1998.

1996

Smell as a Computational Resource - A Lesson We Can Learn from the AntIsrael A. Wagner, Michael Lindenbaum, Alfred M. Bruckstein. istcs 1996: 219-230

1993

An efficient algorithm for some multirow layout problemsJack A. Feldman, Israel A. Wagner, Shmuel Wimer. tcad, 12(8):1178-1185, 1993. [doi]

An Interactive Yield Estimator as a VLSI CAD ToolIsrael A. Wagner, Israel Koren. dft 1993: 167-174