THEORETICAL COMPUTER SCIENCE
Skrót:
THEOR COMPUT SCI
ISSN:
0304-3975
| Rok | Punkty ministerialne | Impact Factor | Eigenfactor | Article influence |
|---|---|---|---|---|
| 2024 | 100 | |||
| 2023 | 100 | 0.00794 | 0.409 | |
| 2022 | 100 | 0.00773 | 0.395 | |
| 2021 | 100 | 0.00923 | 0.453 | |
| 2020 | 100 | 0.01046 | 0.487 | |
| 2019 | 100 | 0.01187 | 0.459 | |
| 2018 | 20 | 0.01188 | 0.421 | |
| 2017 | 20 | 0.01389 | 0.454 | |
| 2016 | 20 | 0.01629 | 0.491 | |
| 2015 | 20 | 0.01694 | 0.526 | |
| 2014 | 20 | 0.01701 | 0.497 | |
| 2013 | 20 | 0.0194 | 0.536 | |
| 2012 | 25 | 0.02136 | 0.574 | |
| 2011 | 27 | 0.02158 | 0.579 | |
| 2010 | 27 | 0.02374 | 0.575 | |
| 2009 | 20 | 0.02207 | 0.504 | |
| 2008 | 15 | 0.02377 | 0.482 | |
| 2007 | 0 | 0.0281 | 0.552 |
Publikacje:
13.
On monochromatic arithmetic progressions in binary words associated with pattern sequences, Theoretical Computer Science vol. 1018 (2024), Article 114815
12.
Robert Janczewski, Paweł Obszarski, Krzysztof Turowski
Weighted 2-sections and hypergraph reconstruction, Theoretical Computer Science vol. 915 (2022), 11-25
11.
Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz
A tight bound for shortest augmenting paths on trees, Theoretical Computer Science vol. 901 (2022), 45-61
10.
Robert Janczewski, Paweł Obszarski, Krzysztof Turowski
2-Coloring number revisited, Theoretical Computer Science vol. 796 (2019), 187-195
9.
Łukasz Merta
Composition inverses of the variations of the Baum–Sweet sequence, Theoretical Computer Science vol. 784 (2019), 81-98
8.
Patryk Mikos
A new lower bound for the on-line coloring of intervals with bandwidth, Theoretical Computer Science vol. 708 (2018), 96-100
7.
Barnaby Martin, Andras Pongracz, Michał Wrona
The Complexity of Counting Quantifiers on Equality Languages, Theoretical Computer Science vol. 670 (2017), 56–67
6.
Jarosław Grytczuk, Karol Kosiński, Michał Zmarz
How to Play Thue Games, Theoretical Computer Science vol. 582 (2015), 83-88
5.
A finite set of functions with an EXPTIME-complete composition problem, Theoretical Computer Science vol. 407 (2008), 330-341
4.
Wit Foryś, Tomasz Krawczyk
An algorithmic approach to the problem of a semiretract base, Theoretical Computer Science vol. 369 (2006), 314-322
3.
Probability distribution for simple tautologies, Theoretical Computer Science vol. 355 (2006), 243-260
2.
Wit Foryś, Tomasz Krawczyk
Semiretracts – a counterexample and some results , Theoretical Computer Science vol. 307 (2003), 117-127
1.
Word Operations Definable in the Typed lambda Calculus, Theoretical Computer Science vol. 52 (1987), 1-14