scispace - formally typeset
Search or ask a question
Institution

University of Warsaw

EducationWarsaw, Poland
About: University of Warsaw is a education organization based out in Warsaw, Poland. It is known for research contribution in the topics: Population & Large Hadron Collider. The organization has 20832 authors who have published 56617 publications receiving 1185084 citations. The organization is also known as: Uniwersytet Warszawski & Warsaw University.


Papers
More filters
Posted Content
TL;DR: It is shown that the aforementioned gap cannot be breached for some problems that aim to maximize the number of connected components like Cycle Packing, and in several cases it is able to show that improving those constants would cause the Strong Exponential Time Hypothesis to fail.
Abstract: For the vast majority of local graph problems standard dynamic programming techniques give c^tw V^O(1) algorithms, where tw is the treewidth of the input graph. On the other hand, for problems with a global requirement (usually connectivity) the best-known algorithms were naive dynamic programming schemes running in tw^O(tw) V^O(1) time. We breach this gap by introducing a technique we dubbed Cut&Count that allows to produce c^tw V^O(1) Monte Carlo algorithms for most connectivity-type problems, including Hamiltonian Path, Feedback Vertex Set and Connected Dominating Set, consequently answering the question raised by Lokshtanov, Marx and Saurabh [SODA'11] in a surprising way. We also show that (under reasonable complexity assumptions) the gap cannot be breached for some problems for which Cut&Count does not work, like CYCLE PACKING. The constant c we obtain is in all cases small (at most 4 for undirected problems and at most 6 for directed ones), and in several cases we are able to show that improving those constants would cause the Strong Exponential Time Hypothesis to fail. Our results have numerous consequences in various fields, like FPT algorithms, exact and approximate algorithms on planar and H-minor-free graphs and algorithms on graphs of bounded degree. In all these fields we are able to improve the best-known results for some problems.

302 citations

Journal ArticleDOI
TL;DR: In this paper, a new Skyrme-like energy density suitable for studies of strongly elongated nuclei has been determined in the framework of the Hartree-Fock-Bogoliubov theory using the recently developed model-based, derivative-free optimization algorithm POUNDerS.
Abstract: A new Skyrme-like energy density suitable for studies of strongly elongated nuclei has been determined in the framework of the Hartree-Fock-Bogoliubov theory using the recently developed model-based, derivative-free optimization algorithm POUNDerS. A sensitivity analysis at the optimal solution has revealed the importance of states at large deformations in driving the parameterization of the functional. The good agreement with experimental data on masses and separation energies, achieved with the previous parameterization UNEDF0, is largely preserved. In addition, the new energy density UNEDF1 gives a much improved description of the fission barriers in ^{240}Pu and neighboring nuclei.

302 citations

Journal ArticleDOI
TL;DR: In this article, the authors search for ν μ oscillations by comparing the rates of ν gm charged-current interactions in two detectors located 130 and 885 m from the target, which was struck by a 92 GeV/c proton beam from the CERN Proton Synchroton.

302 citations

Journal ArticleDOI
TL;DR: In this paper, the formation of (Zn,Cr)Te nanocrystals can be controlled by manipulating the charge state of the Cr ions during the epitaxy, which provides insight into the origin of ferromagnetic signatures in a broad range of semiconductors and oxides, and indicate possible functionalities of these composite systems.
Abstract: The extensive experimental and computational search for multifunctional materials has resulted in the development of semiconductor and oxide systems, such as (Ga,Mn)N, (Zn,Cr)Te and HfO2, which exhibit surprisingly stable ferromagnetic signatures despite having a small or nominally zero concentration of magnetic elements. Here, we show that the ferromagnetism of (Zn,Cr)Te, and the associated magnetooptical and magnetotransport functionalities, are dominated by the formation of Cr-rich (Zn,Cr)Te metallic nanocrystals embedded in the Cr-poor (Zn,Cr)Te matrix. Importantly, the formation of these nanocrystals can be controlled by manipulating the charge state of the Cr ions during the epitaxy. The findings provide insight into the origin of ferromagnetism in a broad range of semiconductors and oxides, and indicate possible functionalities of these composite systems. Furthermore, they demonstrate a bottom-up method for self-organized nanostructure fabrication that is applicable to any system in which the charge state of a constituent depends on the Fermi-level position in the host semiconductor.

300 citations

Journal ArticleDOI
TL;DR: Comparative modeling based on more than 30% sequence identity is now approaching its natural template-based limits and further improvements require the development of effective refinement techniques capable of driving models toward native structure.

300 citations


Authors

Showing all 21191 results

NameH-indexPapersCitations
Alexander Malakhov139148699556
Emmanuelle Perez138155099016
Piotr Zalewski135138889976
Krzysztof Doroba133144089029
Hector F. DeLuca133130369395
Krzysztof M. Gorski132380105912
Igor Golutvin131128288559
Jan Krolikowski131128983994
Michal Szleper130123882036
Anatoli Zarubin129120486435
Malgorzata Kazana129117581106
Artur Kalinowski129116281906
Predrag Milenovic129118581144
Marcin Konecki128117879392
Karol Bunkowski128119279455
Network Information
Related Institutions (5)
Centre national de la recherche scientifique
382.4K papers, 13.6M citations

90% related

University of Paris-Sud
52.7K papers, 2.1M citations

90% related

ETH Zurich
122.4K papers, 5.1M citations

90% related

École Normale Supérieure
99.4K papers, 3M citations

89% related

Max Planck Society
406.2K papers, 19.5M citations

89% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023176
2022619
20212,882
20203,208
20193,130
20183,164