default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRavi Janardan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j57]Jie Xue
, Yuan Li, Saladi Rahul, Ravi Janardan:
New Bounds for Range Closest-Pair Problems. Discret. Comput. Geom. 68(1): 1-49 (2022)- 2020
- [j56]Akash Agrawal, Yuan Li, Jie Xue, Ravi Janardan:
The most-likely skyline problem for stochastic points. Comput. Geom. 88: 101609 (2020) - [j55]Jie Xue, Yuan Li, Ravi Janardan:
Approximate range closest-pair queries. Comput. Geom. 90: 101654 (2020) - [j54]Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
Searching for the closest-pair in a query translate. J. Comput. Geom. 11(2): 26-61 (2020)
2010 – 2019
- 2019
- [j53]Jie Xue, Yuan Li, Ravi Janardan:
On the expected diameter, width, and complexity of a stochastic convex hull. Comput. Geom. 82: 16-31 (2019) - [j52]Yuan Li, Ahmed Eldawy, Jie Xue, Nadezda Knorozova, Mohamed F. Mokbel, Ravi Janardan:
Scalable computational geometry in MapReduce. VLDB J. 28(4): 523-548 (2019) - [c52]Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
Searching for the Closest-Pair in a Query Translate. SoCG 2019: 61:1-61:15 - 2018
- [j51]Jie Xue, Yuan Li, Ravi Janardan:
On the separability of stochastic geometric objects, with applications. Comput. Geom. 74: 1-20 (2018) - [c51]Jie Xue, Yuan Li, Ravi Janardan:
Approximate Range Closest-Pair Search. CCCG 2018: 282-287 - [c50]Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
New Bounds for Range Closest-Pair Problems. SoCG 2018: 73:1-73:14 - [i4]Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
Searching for the closest-pair in a query translate. CoRR abs/1807.09498 (2018) - 2017
- [j50]Yuan Li, Jie Xue, Akash Agrawal, Ravi Janardan:
On the arrangement of stochastic lines in ℤ2. J. Discrete Algorithms 44: 1-20 (2017) - [c49]Akash Agrawal, Yuan Li, Jie Xue, Ravi Janardan:
The Most-Likely Skyline Problem for Stochastic Points. CCCG 2017: 78-83 - [c48]Jie Xue, Yuan Li, Ravi Janardan:
On the Expected Diameter, Width, and Complexity of a Stochastic Convex-Hull. WADS 2017: 581-592 - [i3]Jie Xue, Yuan Li, Ravi Janardan:
On the expected diameter, width, and complexity of a stochastic convex-hull. CoRR abs/1704.07028 (2017) - [i2]Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
New bounds for range closest-pair problems. CoRR abs/1712.09749 (2017) - 2016
- [c47]Jie Xue, Yuan Li, Ravi Janardan:
On the Separability of Stochastic Geometric Objects, with Applications. SoCG 2016: 62:1-62:16 - [i1]Jie Xue, Yuan Li, Ravi Janardan:
On the Separability of Stochastic Geometric Objects, with Applications. CoRR abs/1603.07021 (2016) - 2015
- [j49]Akash Agrawal, Saladi Rahul, Yuan Li, Ravi Janardan:
Range search on tuples of points. J. Discrete Algorithms 30: 1-12 (2015) - 2014
- [j48]Prosenjit Gupta, Ravi Janardan, Yokesh Kumar, Michiel H. M. Smid:
Data structures for range-aggregate extent queries. Comput. Geom. 47(2): 329-347 (2014) - [j47]Saladi Rahul, Ravi Janardan:
A General Technique for Top-$k$ Geometric Intersection Query Problems. IEEE Trans. Knowl. Data Eng. 26(12): 2859-2871 (2014) - 2013
- [c46]Ahmed Eldawy, Yuan Li, Mohamed F. Mokbel, Ravi Janardan:
CG_Hadoop: computational geometry in MapReduce. SIGSPATIAL/GIS 2013: 284-293 - 2012
- [j46]Onur Tekdas, Yokesh Kumar, Volkan Isler, Ravi Janardan:
Building a Communication Bridge With Mobile Hubs. IEEE Trans Autom. Sci. Eng. 9(1): 171-176 (2012) - [c45]Saladi Rahul, Ravi Janardan:
Algorithms for range-skyline queries. SIGSPATIAL/GIS 2012: 526-529 - 2011
- [c44]Saladi Rahul, Prosenjit Gupta, Ravi Janardan, Krishnan Sundara Rajan:
Efficient Top-k Queries for Orthogonal Ranges. WALCOM 2011: 110-121 - 2010
- [j45]Ivaylo Ilinkin, Jieping Ye, Ravi Janardan:
Multiple structure alignment and consensus identification for proteins. BMC Bioinform. 11: 71 (2010)
2000 – 2009
- 2009
- [j44]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Efficient Non-Intersection Queries on Aggregated Geometric Data. Int. J. Comput. Geom. Appl. 19(6): 479-506 (2009) - [c43]Onur Tekdas, Yokesh Kumar, Volkan Isler, Ravi Janardan:
Building a Communication Bridge with Mobile Hubs. ALGOSENSORS 2009: 179-190 - [r3]Jieping Ye, Ravi Janardan, Sudhir Kumar:
Biological Image Analysis via Matrix Approximation. Encyclopedia of Data Warehousing and Mining 2009: 166-170 - 2008
- [j43]Jieping Ye, Jianhui Chen, Ravi Janardan, Sudhir Kumar:
Developmental stage annotation of Drosophila gene expression pattern images via an entire solution path for LDA. ACM Trans. Knowl. Discov. Data 2(1): 4:1-4:21 (2008) - [c42]Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Michiel H. M. Smid:
Data Structures for Range-Aggregate Extent Queries. CCCG 2008 - [c41]Yokesh Kumar, Ravi Janardan, Prosenjit Gupta:
Efficient algorithms for reverse proximity query problems. GIS 2008: 39 - [c40]Jieping Ye, Kewei Chen, Teresa Wu, Jing Li, Zheng Zhao, Rinkal Patel, Min Bae, Ravi Janardan, Huan Liu, Gene E. Alexander, Eric Reiman:
Heterogeneous data fusion for alzheimer's disease study. KDD 2008: 1025-1033 - 2006
- [j42]Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid, Eric Johnson, Paul Castillo, Jörg Schwerdt:
Heuristics for estimating contact area of supports in layered manufacturing. ACM J. Exp. Algorithmics 11 (2006) - [j41]Jieping Ye, Ravi Janardan, Qi Li, Haesun Park:
Feature Reduction via Generalized Uncorrelated Linear Discriminant Analysis. IEEE Trans. Knowl. Data Eng. 18(10): 1312-1322 (2006) - [c39]Jieping Ye, Tao Xiong, Qi Li, Ravi Janardan, Jinbo Bi, Vladimir Cherkassky, Chandra Kambhamettu:
Efficient model selection for regularized linear discriminant analysis. CIKM 2006: 532-539 - [c38]Jieping Ye, Tao Xiong, Ravi Janardan:
CPM: A Covariance-preserving Projection Method. SDM 2006: 24-34 - [c37]Jieping Ye, Ivaylo Ilinkin, Ravi Janardan, Adam Isom:
Multiple Structure Alignment and Consensus Identification for Proteins. WABI 2006: 115-125 - 2005
- [j40]Stefan Atev, Hemanth Arumugam, Osama Masoud, Ravi Janardan, Nikolaos P. Papanikolopoulos:
A vision-based approach to collision prediction at traffic intersections. IEEE Trans. Intell. Transp. Syst. 6(4): 416-423 (2005) - [j39]Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Janardan, Vipin Kumar:
IDR/QR: An Incremental Dimension Reduction Algorithm via QR Decomposition. IEEE Trans. Knowl. Data Eng. 17(9): 1208-1222 (2005) - [c36]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Efficient Non-intersection Queries on Aggregated Geometric Data. COCOON 2005: 544-553 - [c35]Stefan Atev, Osama Masoud, Ravi Janardan, Nikolaos Papanikolopoulos:
A collision prediction system for traffic intersections. IROS 2005: 169-174 - [e2]Ravi Janardan, Michiel H. M. Smid, Debasis Dutta:
Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, October 7-9, 2003. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 67, DIMACS/AMS 2005, ISBN 0-8218-3628-5 [contents] - 2004
- [j38]Jieping Ye, Ravi Janardan, Songtao Liu:
Pairwise Protein Structure Alignment Based on an Orientation-independent Backbone Representation. J. Bioinform. Comput. Biol. 2(4): 699-718 (2004) - [j37]Jieping Ye, Ravi Janardan:
Approximate Multiple Protein Structure Alignment Using the Sum-of-Pairs Distance. J. Comput. Biol. 11(5): 986-1000 (2004) - [j36]Jieping Ye, Ravi Janardan, Cheong Hee Park, Haesun Park:
An Optimization Criterion for Generalized Discriminant Analysis on Undersampled Problems. IEEE Trans. Pattern Anal. Mach. Intell. 26(8): 982-994 (2004) - [j35]Jieping Ye, Tao Li, Tao Xiong, Ravi Janardan:
Using Uncorrelated Discriminant Analysis for Tissue Classification with Gene Expression Data. IEEE ACM Trans. Comput. Biol. Bioinform. 1(4): 181-190 (2004) - [c34]Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid, Eric Johnson, Paul Castillo, Jörg Schwerdt:
Approximating contact-area of supports in layered manufacturing. CCCG 2004: 91-94 - [c33]Jieping Ye, Ravi Janardan, Qi Li, Haesun Park:
Feature extraction via generalized uncorrelated linear discriminant analysis. ICML 2004 - [c32]Jieping Ye, Ravi Janardan, Qi Li:
GPCA: an efficient dimension reduction scheme for image compression and retrieval. KDD 2004: 354-363 - [c31]Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Janardan, Vipin Kumar:
IDR/QR: an incremental dimension reduction algorithm via QR decomposition. KDD 2004: 364-373 - [c30]Tao Xiong, Jieping Ye, Qi Li, Ravi Janardan, Vladimir Cherkassky:
Efficient Kernel Discriminant Analysis via QR Decomposition. NIPS 2004: 1529-1536 - [c29]Jieping Ye, Ravi Janardan, Qi Li:
Two-Dimensional Linear Discriminant Analysis. NIPS 2004: 1569-1576 - [r2]Ravi Janardan, Tony C. Woo:
Manufacturing processes. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 1241-1256 - [r1]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Computational Geometry. Handbook of Data Structures and Applications 2004 - 2003
- [j34]Man Chung Hon, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid:
Minimizing the total projection of a set of vectors, with applications to layered manufacturing. Comput. Aided Des. 35(1): 57-68 (2003) - [j33]Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson:
Protecting critical facets in layered manufacturing: implementation and experimental results. Comput. Aided Des. 35(7): 647-657 (2003) - [c28]Ravi Janardan, Michiel H. M. Smid:
Geometric Algorithms for Layered Manufacturing. Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing 2003: 189-220 - [c27]Jieping Ye, Ravi Janardan, Cheong Hee Park, Haesun Park:
A new optimization criterion for generalized discriminant analysis on undersampled problems. ICDM 2003: 419-426 - [c26]Jieping Ye, Ravi Janardan, Songtao Liu:
Pairwise Protein Structure Alignment Based on an Orientation-Independent Representation of the Backbone Geometry. ICTAI 2003: 2-8 - 2002
- [j32]Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram:
A decomposition-based approach to layered manufacturing. Comput. Geom. 23(2): 117-151 (2002) - [j31]Jörg Schwerdt, Michiel H. M. Smid, Man Chung Hon, Ravi Janardan:
Computing an Optimal Hatching Direction in Layered Manufacturing. Int. J. Comput. Math. 79(10): 1067-1081 (2002) - [c25]Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid:
Terrain Polygon Decomposition, with Application to Layered Manufacturing. COCOON 2002: 381-390 - 2001
- [c24]Man Chung Hon, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid:
Computing Optimal Hatching Directions in Layered Manufacturing. International Conference on Computational Science (1) 2001: 683-692 - [c23]Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram:
A Decomposition-Based Approach to Layered Manufacturing. WADS 2001: 389-400 - 2000
- [j30]Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi:
Protecting critical facets in layered manufacturing. Comput. Geom. 16(3): 187-210 (2000)
1990 – 1999
- 1999
- [j29]Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta:
On some geometric optimization problems in layered manufacturing. Comput. Geom. 12(3-4): 219-239 (1999) - [j28]Jayanth Majhi, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid, Prosenjit Gupta:
Minimizing support structures and trapped area in two-dimensional layered manufacturing. Comput. Geom. 12(3-4): 241-267 (1999) - [j27]Jayanth Majhi, Prosenjit Gupta, Ravi Janardan:
Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. Comput. Geom. 13(4): 229-252 (1999) - [j26]Michiel H. M. Smid, Ravi Janardan:
On the width and roundness of a set of points in the plane. Int. J. Comput. Geom. Appl. 9(1): 97-108 (1999) - [j25]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. Inf. Process. Lett. 69(1): 7-13 (1999) - [j24]Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan:
Computing the Width of a Three-Dimensional Point Set: An Experimental Study. ACM J. Exp. Algorithmics 4: 8 (1999) - [c22]Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi:
Protecting Facets in Layered Manufacturing. FSTTCS 1999: 291-303 - 1998
- [j23]Tony C. Woo, Ravi Janardan:
Special Issue: Computational Geometry and Computer-Aided Design and Manufacturing. Comput. Aided Des. 30(4): 229 (1998) - [c21]Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Jörg Schwerdt:
Multi-Criteria Geometric Optimization Problems in Layered Manufacturing. SCG 1998: 19-28 - [c20]Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan:
Computing the Width of a Three-Dimensional Point Set: An Experimental Study. WAE 1998: 62-73 - [e1]Ravi Janardan:
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, Minneapolis, Minnesota, USA, June 7-10, 1998. ACM 1998, ISBN 0-89791-973-4 [contents] - 1997
- [j22]Kai Tang, Ming-En Wang, Lin-Lin Chen, Shuo-Yan Chou, Tony C. Woo, Ravi Janardan:
Computing planar swept polygons under translation. Comput. Aided Des. 29(12): 825-836 (1997) - [j21]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta:
The Rectangle Enclosure and Point-Dominance Problems Revisited. Int. J. Comput. Geom. Appl. 7(5): 437-455 (1997) - [j20]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
A Technique for Adding Range Restrictions to Generalized Searching Problems. Inf. Process. Lett. 64(5): 263-269 (1997) - [c19]Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta:
On Some Geometric Optimization Problems in Layered Manufacturing. WADS 1997: 136-149 - 1996
- [j19]Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo:
Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining. Comput. Aided Des. 28(8): 577-587 (1996) - [j18]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. Comput. Geom. 6: 1-19 (1996) - [j17]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. Comput. Geom. 6: 371-391 (1996) - [j16]Mario Alberto López, Ravi Janardan, Sartaj K. Sahni:
Efficient net extraction for restricted orientation designs [VLSI layout]. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(9): 1151-1159 (1996) - [c18]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. CCCG 1996: 8-13 - [c17]Jayanth Majhi, Prosenjit Gupta, Ravi Janardan:
Computing a Flattest, Undercut-Free Parting Line for a Convex Polyhedron, with Application to Mold Design. WACG 1996: 109-120 - 1995
- [j15]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. Comput. Geom. 5: 321-340 (1995) - [j14]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. J. Algorithms 19(2): 282-317 (1995) - [c16]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta:
The Rectangle Enclosure and Point-Dominance Problems Revisited. SCG 1995: 162-171 - [c15]Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo:
Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-Machining. WADS 1995: 171-182 - 1994
- [j13]Ravi Janardan, Franco P. Preparata:
Widest-Corridor Problems. Nord. J. Comput. 1(2): 231-245 (1994) - [c14]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects. SCG 1994: 369-378 - [c13]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. ESA 1994: 278-289 - [c12]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
On Intersection Searching Problems Involving Curved Objects. SWAT 1994: 183-194 - 1993
- [j12]Ravi Janardan, Mario Alberto López:
Generalized intersection searching problems. Int. J. Comput. Geom. Appl. 3(1): 39-69 (1993) - [j11]Ravi Janardan:
On maintaining the width and diameter of a planar point-set online. Int. J. Comput. Geom. Appl. 3(3): 331-344 (1993) - [c11]Ravi Janardan, Franco P. Preparata:
Widest-corridor Problems. CCCG 1993: 426-431 - [c10]Mario Alberto López, Ravi Janardan, Sartaj K. Sahni:
A fast algorithm for VLSI net extraction. ICCAD 1993: 770-774 - [c9]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. WADS 1993: 361-372 - 1992
- [j10]Siu-Wing Cheng, Ravi Janardan:
Algorithms for Ray-Shooting and Intersection Searching. J. Algorithms 13(4): 670-692 (1992) - [j9]Ravi Janardan, Siu-Wing Cheng:
Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks. Math. Syst. Theory 25(2): 93-122 (1992) - [j8]Siu-Wing Cheng, Ravi Janardan:
New Results on Dynamic Planar Point Location. SIAM J. Comput. 21(5): 972-999 (1992) - 1991
- [j7]Ravi Janardan:
On the Dynamic Maintenance of Maximal Points in the Plane. Inf. Process. Lett. 40(2): 59-64 (1991) - [j6]Siu-Wing Cheng, Ravi Janardan:
Efficient Maintenance of the Union of Intervals on a Line, with Applications. J. Algorithms 12(1): 57-74 (1991) - [c8]Ravi Janardan:
On Maintaining the Width and Diameter of a Planar Point-Set Online. ISA 1991: 137-149 - [c7]Siu-Wing Cheng, Ravi Janardan:
Space-efficient Ray-shooting and Intersection Searching: Algorithms, Dynamization, and Applications. SODA 1991: 7-16 - 1990
- [j5]Siu-Wing Cheng, Ravi Janardan:
Efficient Dynamic Algorithms for Some Geometric Intersection Problems. Inf. Process. Lett. 36(5): 251-258 (1990) - [j4]Greg N. Frederickson, Ravi Janardan:
Space-Efficient Message Routing in c-Decomposable Networks. SIAM J. Comput. 19(1): 164-181 (1990) - [c6]Siu-Wing Cheng, Ravi Janardan:
New Results on Dynamic Planar Point Location. FOCS 1990: 96-105 - [c5]Siu-Wing Cheng, Ravi Janardan:
Efficient Maintenance of the Union Intervals on a Line, with Applications. SODA 1990: 74-83 - [c4]Ravi Janardan, Siu-Wing Cheng:
Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks. WDAG 1990: 133-150
1980 – 1989
- 1989
- [j3]Greg N. Frederickson, Ravi Janardan:
Efficient Message Routing in Planar Networks. SIAM J. Comput. 18(4): 843-857 (1989) - 1988
- [j2]Greg N. Frederickson, Ravi Janardan:
Designing Networks with Compact Routing Tables. Algorithmica 3: 171-190 (1988) - [j1]Greg N. Frederickson, Ravi Janardan:
Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks. IEEE Trans. Computers 37(12): 1529-1540 (1988) - 1987
- [b1]Ravi Janardan:
Space-efficient schemes for message routing in distributed networks. Purdue University, USA, 1987 - 1986
- [c3]Greg N. Frederickson, Ravi Janardan:
Separator-Based Strategies for Efficient Message Routing (Preliminary Version). FOCS 1986: 428-437 - [c2]Greg N. Frederickson, Ravi Janardan:
Optimal Message Routing without Complete Routing Tables (preliminary version). PODC 1986: 88-97 - 1982
- [c1]Ravi Janardan, K. B. Lakshmanan:
A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem. CRYPTO 1982: 21-37
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-06-27 20:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
