Doron Nussbaum - Citegraph

Author Info

Name	Affiliation	Papers
DORON NUSSBAUM	Dept. of Computer Science, Carleton University, ON, Canada	31
Collaborators	Citations	PageRank
38	89	13.49
Referers	Referees	References
203	621	350

Search Limit

100621

Publications (31 rows)

Collaborators (38 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Identifying Hazardous Shapes in the Plane	0	0.34	2019
Maintaining Anonymity Using (I, J)-Privacy	1	0.35	2017
Moving Target Search with Subgoal Graphs.	0	0.34	2015
Techniques to protect privacy against inference attacks in location based services	2	0.37	2012
Large-scale neuro-modeling for understanding and explaining some brain-related chaotic behavior	0	0.34	2012
Finding Maximum Edge Bicliques in Convex Bipartite Graphs	7	0.51	2012
Efficient, Decentralized Computation of the Topology of Spatial Regions	4	0.42	2011
A new preprocessing filter for digital mammograms	2	0.38	2010
On the message complexity of global computations	0	0.34	2010
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces	15	0.76	2010
Large scale modeling of the piriform cortex for analyzing antiepileptic effects	0	0.34	2008
A Meeting Scheduling Problem Respecting Time and Space	5	0.52	2008
Computing an approximation of the 1-center problem on weighted terrain surfaces	0	0.34	2008
On the longest increasing subsequence of a circular list	7	0.54	2007
Analytic Results on the Hodgkin-Huxley Neural Network: Spikes Annihilation	0	0.34	2007
Some analysis on the network of bursting neurons: quantifying behavioral synchronization	0	0.34	2007
Periodicity and stability issues of a chaotic pattern recognition neural network	8	0.84	2007
GlobeCon: a scalable framework for context aware computing	2	0.39	2007
Numerical results on the Hodgkin-Huxley neural network: spikes annihilation	0	0.34	2007
Shortest path queries between geometric objects on surfaces	1	0.39	2007
An O ( n 2log n ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane	0	0.34	2007
Approximate shortest path queries on weighted polyhedral surfaces	6	0.47	2006
How to Fit In Another Meeting.	1	0.36	2006
Calculating the meeting point of scattered robots on weighted terrain surfaces	9	0.76	2005
Neural Network-Based Chaotic Pattern Recognition - Part 2: Stability and Algorithmic Issues	1	0.48	2005
Concurrent Parallel Shortest Path Computation	0	0.34	2005
Stochastic Sorting Using Deterministic Consecutive and Leader Filters	0	0.34	2004
On the Performance of Distributed Search by Mobile Agents	1	0.41	2004
Parallel implementation of geometric shortest path algorithms	14	0.76	2003
A note on approximations of rectilinear polygons.	0	0.34	1995
Disassembling Two-Dimensional Composite Parts via Translations	3	0.39	1993