DOI,IST REx ID,Title of publication
10.1016/j.uclim.2022.101346,22564,An analytical approximation of urban heat and dry islands and their impact on convection triggering
10.1063/5.0079844,10827,"High-pressure phase behaviors of titanium dioxide revealed by a Δ-learning potential"
10.1088/2632-2153/ac4d11,12128,BenchML: An extensible pipelining framework for benchmarking representations of materials and molecules at scale
10.1063/5.0107059,12249,Computing chemical potentials of solutions from structure factors
10.1038/s41467-022-32374-1,11937,Thermodynamics of high-pressure ice phases explored with atomistic simulations
10.1093/pnasnexus/pgac039,9695,Ranking the information content of distance measures
10.1021/acs.chemmater.2c01967,12237,"Solution-processed inorganic thermoelectric materials: Opportunities and challenges ∇"
10.3934/nhm.2022023,11700,Gradient flow formulation of diffusion equations in the Wasserstein space over a metric graph
10.1109/cvpr52688.2022.01195,12299,How well do sparse ImageNet models transfer?
10.1109/icpr56361.2022.9956195,12161,Lightweight conditional model extrapolation for streaming data under class-prior shift
10.1109/icdcsw56584.2022.00018,12160,Hierarchical consensus: A horizontal scaling framework for blockchains
10.1109/FOCS54457.2022.00091,12432,Solving the Hamilton cycle problem fast on average
10.1109/ISIT50566.2022.9834632,12017,New results on AVCs with omniscient and myopic adversaries
10.1109/ISIT50566.2022.9834815,12018,Lower bounds on list decoding capacity using error exponents
10.1109/ISIT50566.2022.9834829,12019,List-decodable zero-rate codes for the Z-channel
10.48550/arXiv.2204.07373,11366,Revisiting the adversarial robustness-accuracy tradeoff in robot learning
10.1109/sp46214.2022.9833584,12300,Practical asynchronous distributed key generation
10.1109/tit.2022.3167554,12273,Quadratically constrained myopic adversarial channels
10.1109/tcomm.2022.3211101,12233,Decoding Reed-Muller codes with successive codeword permutations
10.1109/TWC.2021.3125626,10364,Parallelism versus latency in simplified successive-cancellation decoding of polar codes