6 papers
Short Graph Sketches Suffice for Error-resilient Leader Verification in CONGEST
Pawel Garncarek, Tomasz JurdziÅski, Dariusz Kowalski +1
Locally Checkable Proofs (LCPs) enable the verification of global graph properties using locally checkable certificates assigned by a prover. Recently, this framework was extended…
Observation of intertwined charge density wave order and superconductivity in Janus monolayer
Subhajit Pramanick, Shubham Patel, Sudip Chakraborty +1
Low-dimensional transition-metal dichalcogenides (TMDCs) provide an ideal platform for studying the emergence of charge density wave (CDW) and superconductivity. The discovery of e…
Distributed Local Verification using Proofs with(out) Errors
PaweÅ Garncarek, Tomasz Jurdzinski, Dariusz Kowalski +1
We study local verification of graph properties in distributed networks under the framework of \emph{locally checkable proofs} (LCPs). In an LCP, a prover assigns proof labels to n…
Pressure induced evolution of anisotropic superconductivity and Fermi surface nesting in a ternary boride
Subhajit Pramanick, Sudip Chakraborty, A. Taraphder
Using Migdal-Eliashberg theory implemented in Electron Phonon Wannier (EPW) code, we have investigated anisotropic superconductivity in a ternary boride . It is…
Asynchronous Gathering of Opaque Robots with Mobility Faults
Subhajit Pramanick, Saswata Jana, Partha Sarathi Mandal +1
We consider the fundamental benchmarking problem of gathering in an -fault system consisting of robots, of which at most might fail at any execution, under asynchron…
Time-optimal Asynchronous Minimal Vertex Covering by Myopic Robots
Saswata Jana, Subhajit Pramanick, Adri Bhattacharya +1
In a connected graph with an autonomous robot swarm with limited visibility, it is natural to ask whether the robots can be deployed to certain vertices satisfying a given property…