Shayok Mukhopadhyay

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Taha Ameen ur Rahman

> Home > Persons > Shayok Mukhopadhyay

Publications

2023
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/tac/RahmanMQ23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tac/RahmanMQ23
Taha Ameen ur Rahman, Shayok Mukhopadhyay, Nasser Qaddoumi:
Computing Robust Forward Invariant Sets of Multidimensional Nonlinear Systems via Geometric Deformation of Polytopes. IEEE Trans. Autom. Control. 68(12): 8293-8300 (2023)
2021
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-2101-10407
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2101-10407
Taha Ameen ur Rahman, Shayok Mukhopadhyay, Nasser Qaddoumi:
Computing Robust Forward Invariant Sets of Multidimensional Non-linear Systems via Geometric Deformation of Polytopes. CoRR abs/2101.10407 (2021)
2019
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/allerton/RahmanMF19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/allerton/RahmanMF19
Taha Ameen ur Rahman, Shayok Mukhopadhyay, Shereen Farhana:
A Novel Expression for Computing Time Response of LTI Systems of Arbitrary Order with Applications to Fractional and Stochastic Control. Allerton 2019: 1007-1014

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.