default search action
Himabindu Gurla
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
- [j13]Dharmavani Bhagavathi, Himabindu Gurla, Stephan Olariu, James L. Schwing, Larry Wilson, Jingyuan Zhang:
Time- and VLSI-Optimal Sorting on Enhanced Meshes. IEEE Trans. Parallel Distributed Syst. 9(10): 929-937 (1998) - [j12]Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing:
Constant-Time Algorithms for Constrained Triangulations on Reconfigurable Meshes. IEEE Trans. Parallel Distributed Syst. 9(11): 1057-1072 (1998) - 1997
- [j11]Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing:
Time-optimal Tree Computations on Sparse Meshes. Discret. Appl. Math. 77(3): 201-220 (1997) - [j10]Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Larry Wilson:
Time-Optimal Domain-Specific Querying on Enhanced Meshes. IEEE Trans. Parallel Distributed Syst. 8(1): 13-24 (1997) - [j9]Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing:
Podality-Based Time-Optimal Computations on Enhanced Meshes. IEEE Trans. Parallel Distributed Syst. 8(10): 1019-1035 (1997) - 1996
- [j8]Dharmavani Bhagavathi, Himabindu Gurla, Stephan Olariu, James L. Schwing, Jingyuan Zhang:
Square Meshes Are Not Optimal for Convex Hull Computation. IEEE Trans. Parallel Distributed Syst. 7(6): 545-554 (1996) - [j7]Dharmavani Bhagavathi, Himabindu Gurla, Stephan Olariu, James L. Schwing, Jingyuan Zhang:
Time- and Cost-Optimal Parallel Algorithms for the Dominance and Visibility Graphs. VLSI Design 4(1): 33-40 (1996) - [c13]Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Larry Wilson:
A unifying methodology for multiple querying on enhanced meshes. SPDP 1996: 392-399 - 1995
- [j6]Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Ivan Stojmenovic:
Time-Optimal Digital Geometry Algorithms on Meshes with Multiple Broadcasting. Int. J. Pattern Recognit. Artif. Intell. 9(4): 601-613 (1995) - [j5]Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing:
Time- and VLSI-Optimal Convex Hull Computation on Meshes with Multiple Broadcasting. Inf. Process. Lett. 56(5): 273-280 (1995) - [j4]Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing:
Constant-Time Convexity Problems on Reconfigurable Meshes. J. Parallel Distributed Comput. 27(1): 86-99 (1995) - [j3]Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Ivan Stojmenovic, Jingyuan Zhang:
Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting. IEEE Trans. Parallel Distributed Syst. 6(7): 687-703 (1995) - [c12]Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Larry Wilson:
Time-optimal ranking algorithms on sorted matrices. ASAP 1995: 42-53 - [c11]Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing:
Antipodality-Based Time-Optimal Computation on Meshes with Multiple Broadcasting. ICPP (3) 1995: 17-20 - [c10]Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Larry Wilson:
A Framework for Solving Geometric Problems on Enhanced Meshes. ICPP (3) 1995: 172-175 - 1994
- [j2]Himabindu Gurla:
Corrigendum: Leftmost one Computation on Meshes with Row Broadcasting. Inf. Process. Lett. 50(2): 111 (1994) - [c9]Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing:
Constant-time triangulation problems on reconfigurable meshes. ASAP 1994: 357-368 - [c8]Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing:
Constant-Time Convexity Problems on Reconfigurable Meshes. Canada-France Conference on Parallel and Distributed Computing 1994: 169-180 - [c7]Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Rong Lin, Stephan Olariu, James L. Schwing, W. Shen, Larry Wilson:
Time-Optimal Multiple Rank Computations on Meshes with Multiple Broadcasting. ICPP (3) 1994: 35-38 - [c6]Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing:
Constant Time Convexity Problems on Dense Reconfigurable Meshes. ICPP (3) 1994: 210-213 - [c5]Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Ivan Stojmenovic, Jingyuan Zhang:
Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting. IPPS 1994: 110-114 - [c4]Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing:
Time-Optimal Tree Computations on Sparse Meshes. WG 1994: 193-205 - 1993
- [j1]Himabindu Gurla:
Leftmost one Computation on Meshes with Row Broadcasting. Inf. Process. Lett. 47(5): 261-266 (1993) - [c3]Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Ivan Stojmenovic, Jingyuan Zhang:
Time-optimal visibility-related algorithms on meshes with multiple broadcasting. ASAP 1993: 226-237 - [c2]Dharmavani Bhagavathi, Himabindu Gurla, Stephan Olariu, James L. Schwing, W. Shen, Larry Wilson, Jingyuan Zhang:
Time- and VLSI-Optimal Sorting on Meshes with Multiple Broadcasting. ICPP (3) 1993: 192-195 - [c1]Dharmavani Bhagavathi, Himabindu Gurla, Stephan Olariu, Rong Lin, James L. Schwing, Jingyuan Zhang:
Square Meshes Are Not Optimal For Convex Hull Computation. ICPP (3) 1993: 307-310
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-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint