Artikel in einem Konferenzbericht,
Data Complexity for Identifying Suitable Algorithms.
P. Ramalingam, N. Fathima, P. Supriya, P. Shetty, M. Sanyal, P. Yeshaswini, M. Rao, N. Darapaneni, und A. Paduri.CCWC, Seite 955-961. IEEE, (2023)
Metadaten
- BibTeX-Schlüssel
- conf/ccwc/RamalingamFSSSYRDP23
- Eintragstyp
- inproceedings
- Buchtitel
- CCWC
- Jahr
- 2023
- Seiten
- 955-961
- Verlag
- IEEE
- BibTeX-Querverweis
- conf/ccwc/2023
- ee
- https://doi.org/10.1109/CCWC57344.2023.10099201
- isbn
- 979-8-3503-3286-5
- URL
- http://dblp.uni-trier.de/db/conf/ccwc/ccwc2023.html#RamalingamFSSSYRDP23
Tags
Nutzer
Kommentare und Rezensionenanzeigen / verbergen
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -%0 Conference Paper
%1 conf/ccwc/RamalingamFSSSYRDP23
%A Ramalingam, Prem Anand
%A Fathima, Nikhat
%A Supriya, P.
%A Shetty, Prathish
%A Sanyal, Mainak
%A Yeshaswini, P.
%A Rao, Mukesh
%A Darapaneni, Narayana
%A Paduri, Anwesh Reddy
%B CCWC
%D 2023
%I IEEE
%K dblp
%P 955-961
%T Data Complexity for Identifying Suitable Algorithms.
%U http://dblp.uni-trier.de/db/conf/ccwc/ccwc2023.html#RamalingamFSSSYRDP23
%@ 979-8-3503-3286-5
@inproceedings{conf/ccwc/RamalingamFSSSYRDP23,
added-at = {2023-04-26T00:00:00.000+0200},
author = {Ramalingam, Prem Anand and Fathima, Nikhat and Supriya, P. and Shetty, Prathish and Sanyal, Mainak and Yeshaswini, P. and Rao, Mukesh and Darapaneni, Narayana and Paduri, Anwesh Reddy},
biburl = {https://www.bibsonomy.org/bibtex/2afdbeeccf6d8d0065aaa02cf1f75da8e/dblp},
booktitle = {CCWC},
crossref = {conf/ccwc/2023},
ee = {https://doi.org/10.1109/CCWC57344.2023.10099201},
interhash = {57bb64e4810b23fd032372ae038c8c72},
intrahash = {afdbeeccf6d8d0065aaa02cf1f75da8e},
isbn = {979-8-3503-3286-5},
keywords = {dblp},
pages = {955-961},
publisher = {IEEE},
timestamp = {2024-04-10T00:13:01.000+0200},
title = {Data Complexity for Identifying Suitable Algorithms.},
url = {http://dblp.uni-trier.de/db/conf/ccwc/ccwc2023.html#RamalingamFSSSYRDP23},
year = 2023
}