default search action
Doron Nussbaum
Person information
- affiliation: Carleton University, Ottawa, Canada
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j14]Doron Nussbaum, Fedor Ilitchev:
Chasing an intruder with limited information. Int. J. Intell. Robotics Appl. 7(4): 652-670 (2023) - 2020
- [c32]Doron Nussbaum, Fedor Ilitchev:
Catching a Robot Intruder with Limited Information. IRC 2020: 17-23
2010 – 2019
- 2019
- [c31]Doron Nussbaum, Stephanie Thoumy:
Identifying Hazardous Shapes in the Plane. IRC 2019: 271-276 - 2017
- [j13]Doron Nussbaum, Masoud T. Omran, Jörg-Rüdiger Sack:
Maintaining anonymity using -privacy. J. Locat. Based Serv. 11(1): 1-28 (2017) - 2015
- [c30]Doron Nussbaum, Alper Yörükçü:
Moving Target Search with Subgoal Graphs. ICAPS 2015: 179-187 - [c29]Doron Nussbaum, Alper Yörükçü:
Moving Target Search with Subgoal Graphs. SOCS 2015: 232-233 - 2012
- [j12]Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh:
Finding Maximum Edge Bicliques in Convex Bipartite Graphs. Algorithmica 64(2): 311-325 (2012) - [j11]Dragos Calitoiu, B. John Oommen, Doron Nussbaum:
Large-scale neuro-modeling for understanding and explaining some brain-related chaotic behavior. Simul. 88(11): 1316-1337 (2012) - [c28]Doron Nussbaum, Masoud T. Omran, Jörg-Rüdiger Sack:
Techniques to protect privacy against inference attacks in location based services. IWGS@SIGSPATIAL/GIS 2012: 58-67 - 2011
- [j10]Matt Duckham, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro:
Efficient, Decentralized Computation of the Topology of Spatial Regions. IEEE Trans. Computers 60(8): 1100-1113 (2011) - 2010
- [j9]Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discret. Comput. Geom. 44(4): 762-801 (2010) - [c27]Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh:
Finding Maximum Edge Bicliques in Convex Bipartite Graphs. COCOON 2010: 140-149 - [c26]Peyman Rahmati, Ghassan Hamarneh, Doron Nussbaum, Andy Adler:
A New Preprocessing Filter for Digital Mammograms. ICISP 2010: 585-592 - [c25]Doron Nussbaum, Nicola Santoro:
On the Message Complexity of Global Computations. OPODIS 2010: 427-442
2000 – 2009
- 2009
- [j8]Florian Berger, Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
A meeting scheduling problem respecting time and space. GeoInformatica 13(4): 453-481 (2009) - 2008
- [j7]Dragos Calitoiu, B. John Oommen, Doron Nussbaum:
Spikes annihilation in the Hodgkin-Huxley neuron. Biol. Cybern. 98(3): 239-257 (2008) - [j6]Mark Lanthier, Doron Nussbaum, Tsuo-Jung Wang:
Computing an approximation of the 1-center problem on weighted terrain surfaces. ACM J. Exp. Algorithmics 13 (2008) - [c24]Florian Berger, Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
A Meeting Scheduling Problem Respecting Time and Space. AAIM 2008: 50-59 - [c23]Dragos Calitoiu, Doron Nussbaum, B. John Oommen:
Large scale modeling of the piriform cortex for analyzing antiepileptic effects. SpringSim 2008: 599-608 - 2007
- [j5]Michael H. Albert, Mike D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro:
On the longest increasing subsequence of a circular list. Inf. Process. Lett. 101(2): 55-59 (2007) - [j4]Dragos Calitoiu, B. John Oommen, Doron Nussbaum:
Periodicity and stability issues of a chaotic pattern recognition neural network. Pattern Anal. Appl. 10(3): 175-188 (2007) - [j3]Dragos Calitoiu, B. John Oommen, Doron Nussbaum:
Desynchronizing a Chaotic Pattern Recognition Neural Network to Model Inaccurate Perception. IEEE Trans. Syst. Man Cybern. Part B 37(3): 692-704 (2007) - [c22]Dragos Calitoiu, B. John Oommen, Doron Nussbaum:
Analytic Results on the Hodgkin-Huxley Neural Network: Spikes Annihilation. Canadian AI 2007: 320-331 - [c21]Dragos Calitoiu, B. John Oommen, Doron Nussbaum:
Some Analysis on the Network of Bursting Neurons: Quantifying Behavioral Synchronization. Australian Conference on Artificial Intelligence 2007: 110-119 - [c20]Dragos Calitoiu, B. John Oommen, Doron Nussbaum:
Numerical Results on the Hodgkin-Huxley Neural Network: Spikes Annihilation. BVAI 2007: 378-387 - [c19]Kaiyuan Lu, Doron Nussbaum, Jörg-Rüdiger Sack:
GlobeCon - A Scalable Framework for Context Aware Computing. EuroSSC 2007: 190-206 - [c18]Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
Shortest Path Queries Between Geometric Objects on Surfaces. ICCSA (1) 2007: 82-95 - [c17]Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
An O ( n 2log n ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane. ISAAC 2007: 668-680 - 2006
- [c16]Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
How to Fit In Another Meeting. CollaborateCom 2006 - [c15]Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. MFCS 2006: 98-109 - 2005
- [c14]Mark Lanthier, Doron Nussbaum, Tsuo-Jung Wang:
Calculating the Meeting Point of Scattered Robots on Weighted Terrain Surfaces. CATS 2005: 107-118 - [c13]Dragos Calitoiu, B. John Oommen, Doron Nussbaum:
Neural Network-Based Chaotic Pattern Recognition - Part 2: Stability and Algorithmic Issues. CORES 2005: 3-16 - [c12]J. Chen, Mark Lanthier, Melissa Macpherson, Doron Nussbaum:
Computing Tumour Coverage as a Result of Respiratory Motion during Radiotherapy Treatment. ICITA (2) 2005: 107-112 - [c11]Doron Nussbaum, Jörg-Rüdiger Sack, Hua Ye:
Concurrent Parallel Shortest Path Computation. PARCO 2005: 277-284 - 2004
- [c10]B. John Oommen, Jack R. Zgierski, Doron Nussbaum:
Deterministic Majority filters applied to stochastic sorting. ACM Southeast Regional Conference 2004: 228-233 - [c9]Andras Frankel, Doron Nussbaum, Jörg-Rüdiger Sack:
Floating-Point Filter for the Line Intersection Algorithm. GIScience 2004: 94-105 - [c8]Abdul-Rahman Mawlood-Yunis, Amiya Nayak, Doron Nussbaum, Nicola Santoro:
Comparing Performance of Two Mobile Agent Platforms in Distributed Search. IAT 2004: 425-428 - [c7]Abdul-Rahman Mawlood-Yunis, Amiya Nayak, Doron Nussbaum, Nicola Santoro:
On the Performance of Distributed Search by Mobile Agents. MATA 2004: 285-294 - [c6]B. John Oommen, Jack R. Zgierski, Doron Nussbaum:
Stochastic Sorting Using Deterministic Consecutive and Leader Filters. MSV/AMCS 2004: 399-405 - 2003
- [j2]Mark Lanthier, Doron Nussbaum, Jörg-Rüdiger Sack:
Parallel implementation of geometric shortest path algorithms. Parallel Comput. 29(10): 1445-1479 (2003)
1990 – 1999
- 1997
- [c5]Doron Nussbaum:
Rectilinear p-Piercing Problems. ISSAC 1997: 316-323 - 1996
- [c4]David A. Hutchinson, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack:
Parallel Neighbourhood Modelling. ACM-GIS 1996: 25-34 - [c3]David A. Hutchinson, L. Küttner, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack:
Parallel Neighborhood Modeling. SPAA 1996: 204-207 - 1995
- [c2]Jian Huang, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
A note on approximations of rectilinear polygons. CCCG 1995: 43-48 - 1993
- [j1]Doron Nussbaum, Jörg-Rüdiger Sack:
Disassembling two-dimensional composite parts via translations. Int. J. Comput. Geom. Appl. 3(1): 71-84 (1993)
1980 – 1989
- 1989
- [c1]Doron Nussbaum, Jörg-Rüdiger Sack:
Disassembling Two-Dimensional Composite Parts via Translations. Optimal Algorithms 1989: 153-167
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint