Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID60th Birthday: Juraj Hromkovic , 2018
- Hans-Joachim Böckenhauer, Dennis Komm, Walter Unger:
Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 11011, Springer 2018, ISBN 978-3-319-98354-7
Automata and Formal Languages
- Pavol Duris, Rafael Korbas, Rastislav Královic
, Richard Královic:
Determinism and Nondeterminism in Finite Automata with Advice. 3-16 - Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity. 17-32 - Christos A. Kapoutsis:
Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols. 33-48 - Juhani Karhumäki, Markus A. Whiteland:
Regularity of k-Abelian Equivalence Classes of Fixed Cardinality. 49-62 - Jetty Kleijn, Maciej Koutny, Lukasz Mikulski, Grzegorz Rozenberg:
Reaction Systems, Transition Systems, and Equivalences. 63-84 - Branislav Rovan, Simon Sádovský:
On Usefulness of Information: Framework and NFA Case. 85-99 - Arto Salomaa:
Parikh Matrices: Subword Indicators and Degrees of Ambiguity. 100-112 - Georg Schnitger:
Probabilism versus Alternation for Automata. 113-126
Algorithmics
- Farid M. Ablayev, Marat Ablayev, Kamil Khadiev, Alexander Vasiliev:
Classical and Quantum Computations with Restricted Memory. 129-155 - Annalisa D'Andrea, Luca Forlizzi, Guido Proietti:
Stability of Reapproximation Algorithms for the \beta β -Metric Traveling Salesman (Path) Problem. 156-171 - Hans-Joachim Böckenhauer, Lucia Di Caro, Walter Unger:
Fully Online Matching with Advice on General Bipartite Graphs and Paths. 172-190 - Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer:
Sequence Hypergraphs: Paths, Flows, and Cuts. 191-215 - Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Relative Worst-Order Analysis: A Survey. 216-230 - Elisabet Burjons, Fabian Frei, Jasmin Smula, David Wehner:
Length-Weighted Disjoint Path Allocation - Advice and Parametrization. 231-256 - Martin Dietzfelbinger:
Universal Hashing via Integer Arithmetic Without Primes, Revisited. 257-279 - Shogo Ehara, Kazuo Iwama, Junichi Teruyama:
Small Complexity Gaps for Comparison-Based Sorting. 280-296 - Josep Fàbrega, Xavier Muñoz:
Online Matching in Regular Bipartite Graphs with Randomized Adversary. 297-310 - Björn Feldkord, Manuel Malatyali, Friedhelm Meyer auf der Heide:
A Dynamic Distributed Data Structure for Top-k and k-Select Queries. 311-329 - Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller:
What Is Known About Vertex Cover Kernelization? 330-356 - Michael R. Fellows, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza:
A Survey on the Complexity of Flood-Filling Games. 357-376 - Walter Gander:
Infinity and Finite Arithmetic. 377-392 - Ralf Klasing, Tobias Mömke:
A Modern View on Stability of Approximation. 393-408 - Marios Mavronicolas, Burkhard Monien:
NP NP -Hardness of Equilibria in Case of Risk-Averse Players. 409-422 - Joss Miller-Todd, Kathleen Steinhöfel, Patrick Veenstra:
Firefly-Inspired Algorithm for Job Shop Scheduling. 423-433 - Takashi Okumura, Koichi Wada, Yoshiaki Katayama:
Rendezvous of Asynchronous Mobile Robots with Lights. 434-448 - Peter Rossmanith:
On the Advice Complexity of Online Edge- and Node-Deletion Problems. 449-462 - Stefan Wolf:
Second Thoughts on the Second Law. 463-476 - Anna Zych-Pawlewicz:
Reoptimization of NP-Hard Problems. 477-494
Computer Science Education
- Tim Bell, Jan Vahrenhold:
CS Unplugged - How Is It Used, and Does It Work? 497-521 - Valentina Dagiene:
Resurgence of Informatics Education in Schools - A Way to a Deeper Understanding of Informatics Concepts. 522-537 - Jens Gallenbacher:
The Adventure of Computer Science - Understanding the Impact of Informatics on General Education and Designing the Living Environment. 538-548 - David Harel, Assaf Marron:
Toward Scenario-Based Algorithmics. 549-567 - Lane A. Hemaspaandra:
That Most Important Intersection. 568-589 - Ulrik Schroeder, Nadine Bergner, Thiemo Leonhardt:
Paving the Way for Computer Science in German Schools. 590-609 - Tom Verhoeff:
A Master Class on Recursion. 610-633
Epilogue
- Christos H. Papadimitriou:
About Place Cells and Grid Cells - About Place Cells and Grid Cells. 637-640
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-26 17:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
