SelectedWorks - Avah Banerjee

Skip to main content

MENU Toggle navigation menu

Sign up
Log in

Missouri University of Science and Technology Scholars' Mine Gallery Expert Gallery

Contact

Selected Works of Avah Banerjee

Selected Works of Save Cancel

Assistant Professor, Computer Science; Investigator, Intelligent Systems Center

Title Save Cancel

Dr. Avah (Indranil) Banerjee joined Missouri S&T as an Assistant Professor in the Computer Science department in August 2020. She received Ph.D. and M.S. degrees in Computer Science from George Mason University and a Bachelor of Technology with honors in Electrical Engineering. Prior to joining S&T she was a postdoc at the Center for Computation and technology, LSU investigating approximation hardness of certain graph partitioning problems.

New Faculty 2020-2021
Investigator, Intelligent Systems Center

Works
About

×

About Avah Banerjee

Dr. Avah (Indranil) Banerjee joined Missouri S&T as an Assistant Professor in the Computer Science department in August 2020. She received Ph.D. and M.S. degrees in Computer Science from George Mason University and a Bachelor of Technology with honors in Electrical Engineering. Prior to joining S&T she was a postdoc at the Center for Computation and technology, LSU investigating approximation hardness of certain graph partitioning problems.

New Faculty 2020-2021
Investigator, Intelligent Systems Center

Positions

August 2020 - Present	Assistant Professor, Missouri University of Science and Technology ‐ Computer Science
Institution Organization Position Type Position Title Time Period to Options Current Position Affiliate my profile with this Institution
August 2018 - July 2020	Postdoc, Center for Computation & Technology (CCT), Louisiana State University
Institution Organization Position Type Position Title Time Period to Options Current Position Affiliate my profile with this Institution
January 2010 - March 2011	Software Engineer, Videonetics Technology Pvt. Ltd.
Institution Organization Position Type Position Title Time Period to Options Current Position Affiliate my profile with this Institution

Disciplines

Computer Sciences

Research Interests

Algorithms and Data Structures, Combinatorial and Graph Algorithms, Randomness and Approximation, Computational Geometry, Theoretical Machine Learning, Approximation hardness of minimization problems, Graph reconguration, and Sub-graph Connectivity

Title

URL

Funding Agency

Grant Name

Grant Number

Amount

$

Role

Colleague(s)

Time Period

to

Enter a valid date range.

Current Grant

Position

Affiliation

Time Period

to

Enter a valid date range.

Current Position

URL

Education

Institution

Organization

Student Type

Student Title

Degree

Time Period

to

Options

Currently enrolled

Affiliate my profile with this Institution

2018	Ph.D. in Computer Science, George Mason University
Institution Organization Student Type Student Title Degree Time Period to Options Currently enrolled Affiliate my profile with this Institution
2015	M.S. in Computer Science, George Mason University
Institution Organization Student Type Student Title Degree Time Period to Options Currently enrolled Affiliate my profile with this Institution
2009	BTech, Electrical Engineering, National Institute of Technology, Durgapur, India
Institution Organization Student Type Student Title Degree Time Period to Options Currently enrolled Affiliate my profile with this Institution

Links

Scopus Author Profile
Google Scholar
Dr. Banerjee's website

Contact Information

Computer Science Building

Missouri University of Science and Technology

Rolla, MO 65401

(573) 341-4491

Email:

ORCID

http://orcid.org/0000-0002-3059-0748

View All
Research Works

Research Works (11)

Distributed Matrix Tiling using a Hypergraph Labeling Formulation

ACM International Conference Proceeding Series (2022)

Avah Banerjee, Maxwell Reeser and Guoli Ding

Partitioning large matrices is an important problem in distributed linear algebra computing, used in ML among others. Briefly, our goal ...

Distributed Matrix Tiling using a Hypergraph Labeling Formulation

ACM International Conference Proceeding Series (2022)

Avah Banerjee, Maxwell Reeser and Guoli Ding

Partitioning large matrices is an important problem in distributed linear algebra computing, used in ML among others. Briefly, our goal ...

An Adjacency Labeling Scheme based on a Decomposition of Trees ...

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2022)

In this paper we look at the problem of adjacency labeling of graphs. Given a family of undirected graphs the ...

An Adjacency Labeling Scheme based on a Decomposition of Trees ...

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2022)

In this paper we look at the problem of adjacency labeling of graphs. Given a family of undirected graphs the ...

Locality-Aware Qubit Routing for the Grid Architecture

Proceedings - 2022 IEEE 36th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2022 (2022)

Avah Banerjee, Xin Liang and R. Tohid

Due to the short decohorence time of qubits available in the NISQ-era, it is essential to pack (minimize the size ...

Locality-Aware Qubit Routing for the Grid Architecture

Proceedings - 2022 IEEE 36th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2022 (2022)

Avah Banerjee, Xin Liang and R. Tohid

Due to the short decohorence time of qubits available in the NISQ-era, it is essential to pack (minimize the size ...

A Sorting Network on Trees

Parallel Processing Letters (2019)

Avah Banerjee and Dana Richards

Sorting networks are a class of parallel oblivious sorting algorithms. Not only do they have interesting theoretical properties but they ...

Sorting Networks on Restricted Topologies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2019)

Avah Banerjee, Dana Richards and Igor Shinkar

The sorting number of a graph with n vertices is the minimum depth of a sorting network with n inputs ...

New Results on Routing via Matchings on Graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2017)

Avah Banerjee and Dana Richards

In this paper we present some new complexity results on the routing time of a graph under the routing via ...

Sorting under Forbidden Comparisons

Leibniz International Proceedings in Informatics, LIPIcs (2016)

Avah Banerjee and Dana Richards

In this paper we study the problem of sorting under forbidden comparisons where some pairs of elements may not be ...

Computing Maximal Layers of Points in Eᶠ⁽ⁿ⁾

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016)

Avah Banerjee and Dana Richards

In this paper we present a randomized algorithm for computing the collection of maximal layers for a point set in ...

Copyright 1999–2024 bepress.™ All rights reserved.

Contact Us
Terms of Service
Copyright
Privacy Policy
User Guide