![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Aaron Kershenbaum
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [c35]Aaron Kershenbaum, Alicia Cutillo, Christian Darabos, Keitha A. Murray, Robert Schiaffino, Jason H. Moore
:
Bicliques in Graphs with Correlated Edges: From Artificial to Biological Networks. EvoApplications (1) 2016: 138-155
2000 – 2009
- 2009
- [i1]Genady Grabarnik, Aaron Kershenbaum:
Safe Reasoning Over Ontologies. CoRR abs/0904.0228 (2009) - 2008
- [c34]Alina Beygelzimer, Aaron Kershenbaum, Kang-Won Lee, Vasileios Pappas:
The benefits of directional antennas in heterogeneouswireless ad-hoc networks. MASS 2008: 442-449 - [p1]Stijn Heymans, Li Ma, Darko Anicic, Zhilei Ma, Nathalie Steinmetz, Yue Pan, Jing Mei, Achille Fokoue, Aditya Kalyanpur, Aaron Kershenbaum, Edith Schonberg, Kavitha Srinivas, Cristina Feier, Graham Hench, Branimir Wetzstein, Uwe Keller:
Ontology Reasoning with Large Data Repositories. Ontology Management 2008: 89-128 - 2007
- [j18]Richard A. Mushlin, Aaron Kershenbaum, Stephen T. Gallagher, Timothy R. Rebbeck:
A graph-theoretical approach for pattern discovery in epidemiological research. IBM Syst. J. 46(1): 135-150 (2007) - [c33]Julian Dolby, Achille Fokoue, Aditya Kalyanpur, Aaron Kershenbaum, Edith Schonberg, Kavitha Srinivas, Li Ma:
Scalable Semantic Retrieval through Summarization and Refinement. AAAI 2007: 299-304 - [c32]Robert Schiaffino, Achille Fokoue, Aditya Kalyanpur, Aaron Kershenbaum, Li Ma, Chintan Patel, Edith Schonberg, Kavitha Srinivas:
Computing OWL Ontology Decompositions Using Resolution. WoMO 2007 - [c31]Julian Dolby, James Fan, Achille Fokoue, Aditya Kalyanpur, Aaron Kershenbaum, Li Ma, J. William Murdock, Kavitha Srinivas, Christopher A. Welty:
Scalable Cleanup of Information Extraction Data Using Ontologies. ISWC/ASWC 2007: 100-113 - [c30]Chintan Patel, James J. Cimino
, Julian Dolby, Achille Fokoue, Aditya Kalyanpur, Aaron Kershenbaum, Li Ma, Edith Schonberg, Kavitha Srinivas:
Matching Patient Records to Clinical Trials Using Ontologies. ISWC/ASWC 2007: 816-829 - 2006
- [c29]Achille Fokoue, Aaron Kershenbaum, Li Ma:
SHIN ABox Reduction. Description Logics 2006 - [c28]Aaron Kershenbaum, Achille Fokoue, Chintan Patel, Christopher A. Welty, Edith Schonberg, James J. Cimino, Li Ma, Kavitha Srinivas, Robert J. Schloss, J. William Murdock:
A View of OWL From the Field: Use-cases and Experiences. OWLED 2006 - [c27]Achille Fokoue, Aaron Kershenbaum, Li Ma, Edith Schonberg, Kavitha Srinivas:
The Summary Abox: Cutting Ontologies Down to Size. ISWC 2006: 343-356 - 2005
- [j17]James W. Cooper, Aaron Kershenbaum:
Discovery of protein-protein interactions using a combination of linguistic, statistical and graphical information. BMC Bioinform. 6: 143 (2005) - 2004
- [c26]George Leeman, Aaron Kershenbaum, Larry Koved, Darrell Reimer:
Detecting unwanted synchronization in Java programs. IASTED Conf. on Software Engineering and Applications 2004: 122-132 - [c25]Harini Srinivasan, Darrell Reimer, Aaron Kershenbaum, Edith Schonberg, Kavitha Srinivas:
Static validation of resource management in large Java applications. ISoLA (Preliminary proceedings) 2004: 250-252 - [c24]Darrell Reimer, Edith Schonberg, Kavitha Srinivas, Harini Srinivasan, Bowen Alpern, Robert D. Johnson, Aaron Kershenbaum, Larry Koved:
SABER: smart analysis based error reduction. ISSTA 2004: 243-251 - [c23]Darrell Reimer, Edith Schonberg, Kavitha Srinivas, Harini Srinivasan, Julian Dolby, Aaron Kershenbaum, Larry Koved:
Validating structural properties of nested objects. OOPSLA Companion 2004: 294-304 - 2002
- [c22]Larry Koved, Marco Pistoia, Aaron Kershenbaum:
Access rights analysis for Java. OOPSLA 2002: 359-372 - 2000
- [c21]Stephen D'Alessio, Keitha A. Murray, Robert Schiaffino, Aaron Kershenbaum:
The Effect of Using Hierarchical Classifiers in Text Categorization. RIAO 2000: 302-313
1990 – 1999
- 1998
- [c20]Stephen D'Alessio, Keitha A. Murray, Robert Schiaffino, Aaron Kershenbaum:
The Effect of Topological Structure on Hierarchical Text Categorization. VLC@COLING/ACL 1998 - [c19]Michal Ziv-Ukelson, Aaron Kershenbaum:
A Dictionary Matching Algorithm Fast on the Average for Terms of Varying Length. CPM 1998: 34-54 - [c18]Stephen D'Alessio, Keitha A. Murray, Robert Schiaffino, Aaron Kershenbaum:
Category Levels in Hierarchical Text Categorization. EMNLP 1998: 61-70 - 1997
- [j16]Aaron Kershenbaum:
When Genetic Algorithms Work Best. INFORMS J. Comput. 9(3): 254-255 (1997) - 1996
- [c17]David M. Chess, Colin G. Harrison, Aaron Kershenbaum:
Mobile Agents: Are They a Good Idea? Mobile Object Systems 1996: 25-45 - [c16]David M. Chess, Colin G. Harrison, Aaron Kershenbaum:
Update. Mobile Object Systems 1996: 46-48 - 1995
- [j15]Charles C. Palmer, Aaron Kershenbaum:
An approach to a problem in network design using genetic algorithms. Networks 26(3): 151-163 (1995) - [c15]Alexander Birman, Aaron Kershenbaum:
Routing and Wavelength Assignment Methods in Single-Hop All-Optical Networks with Blocking. INFOCOM 1995: 431-438 - 1994
- [c14]Robert R. Boorstyn, Aaron Kershenbaum:
Characterization of bursty sources and capacity estimation in high speed networks. CAMAD 1994 - [c13]Charles C. Palmer, Aaron Kershenbaum:
Representing Trees in Genetic Algorithms. International Conference on Evolutionary Computation 1994: 379-384 - 1993
- [j14]Robert I. Chou, Aaron Kershenbaum, Edward K. Wong:
Representation and recognition of handprinted Chinese characters by string-matching. Inf. Sci. 67(1-2): 1-34 (1993) - 1992
- [c12]Hong Liu, Aaron Kershenbaum, Richard M. Van Slyke:
Artificial Intelligence Applications to Communication Network Design with Bulk Facilities. ACM Conference on Computer Science 1992: 345-350 - 1991
- [j13]Robert S. Cahn, Pao-Chi Chang, Parviz Kermani, Aaron Kershenbaum:
INTREPID: an integrated network tool for routing, evaluation of performance, and interactive design. IEEE Commun. Mag. 29(7): 40-47 (1991) - [j12]Aaron Kershenbaum, Michael J. Post:
Distributed scheduling of CDMA networks with minimal information. IEEE Trans. Commun. 39(1): 17-20 (1991) - [j11]Aaron Kershenbaum, Parviz Kermani, George A. Grover:
MENTOR: an algorithm for mesh network topological optimization and routing. IEEE Trans. Commun. 39(4): 503-513 (1991) - 1990
- [c11]Aaron Kershenbaum, Teresa Rubinson:
An Application of Fuzzy Multi-Criteria Decision Making for Topological Design of Large Networks. IPMU 1990: 528-537 - [c10]Mon-Song Chen, Yanghee Choi, Aaron Kershenbaum:
Approaches utilizing segment overlap to minimize test sequences. PSTV 1990: 85-98
1980 – 1989
- 1989
- [j10]Michael J. Post, Aaron Kershenbaum, Philip E. Sarachik:
Scheduling Multihop CDMA Networks in the Presence of Secondary Conflicts. Algorithmica 4(3): 365-393 (1989) - [j9]Chi-Chun Lo, Aaron Kershenbaum:
A two-phase algorithm and performance bounds for the star-star concentrator location problem. IEEE Trans. Commun. 37(11): 1151-1163 (1989) - [c9]Maria C. Yuang, Aaron Kershenbaum:
Parallel Protocol Verification: The Two-Phase Algorithm and Complexity Analysis. Automatic Verification Methods for Finite State Systems 1989: 303-316 - [c8]Maria C. Yuang, Aaron Kershenbaum:
Parallel protocol verification using the two-phase algorithm. COMPSAC 1989: 184-192 - [c7]Maria C. Yuang, Aaron Kershenbaum:
Parallel Protocol Verification: The Two-Phase Algorithm. PSTV 1989: 339-353 - 1988
- [c6]Chi-Chun Lo, Aaron Kershenbaum:
A two-phase algorithm for the star-star concentrator location problem. INFOCOM 1988: 946-955 - 1987
- [j8]Aaron Kershenbaum, Robert R. Boorstyn, Mon-Song Chen:
An Algorithm for Evaluation of Throughput in Multihop Packet Radio Networks with Complex Topologies. IEEE J. Sel. Areas Commun. 5(6): 1003-1012 (1987) - [j7]Robert R. Boorstyn, Aaron Kershenbaum, Basil S. Maglaris
, Veli Sahin:
Throughput Analysis in Multihop CSMA Packet Radio Networks. IEEE Trans. Commun. 35(3): 267-274 (1987) - 1984
- [c5]Aaron Kershenbaum, Robert R. Boorstyn:
Evaluation of Throughput in Multihop Packet Radio Networks with Complex Topologies. INFOCOM 1984: 330-335 - 1983
- [j6]Aaron Kershenbaum, Robert R. Boorstyn:
Centralized teleprocessing network design. Networks 13(2): 279-293 (1983) - [c4]Basil S. Maglaris, Robert R. Boorstyn, Aaron Kershenbaum:
Extensions to the Analysis of Multihop Packet Radio Networks. INFOCOM 1983: 390-395 - 1981
- [j5]Aaron Kershenbaum:
A note on finding shortest path trees. Networks 11(4): 399-400 (1981) - 1980
- [j4]Aaron Kershenbaum, Robert R. Boorstyn, Rosa Oppenheim:
Second-Order Greedy Algorithms for Centralized Teleprocessing Network Design. IEEE Trans. Commun. 28(10): 1835-1838 (1980)
1970 – 1979
- 1974
- [j3]Aaron Kershenbaum:
Computing capacitated minimal spanning trees efficiently. Networks 4(4): 299-310 (1974) - [j2]Aaron Kershenbaum, Wushow Chou:
A Unified Algorithm for Designing Multidrop Teleprocessing Networks. IEEE Trans. Commun. 22(11): 1762-1772 (1974) - [c3]Aaron Kershenbaum:
Tools for planning and designing data communications networks. AFIPS National Computer Conference 1974: 583-591 - 1973
- [j1]Aaron Kershenbaum, Richard M. Van Slyke:
Recursive analysis of network reliability. Networks 3(1): 81-94 (1973) - [c2]Wushow Chou, Aaron Kershenbaum:
A unified algorithm for designing multidrop teleprocessing networks. DATACOMM 1973: 148-156 - 1972
- [c1]Aaron Kershenbaum, Richard M. Van Slyke:
Computing minimum spanning trees efficiently. ACM Annual Conference (1) 1972: 518-527
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint