Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Pacholski, Leszek"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Set constraints with projections
Witold Charatonik
,
Leszek Pacholski
Journal of the ACM
57
(4), 2010, pp. 23: 1-37
Complexity results for first-order two-variable logic with counting
Leszek Pacholski
,
Wiesƚaw Szwast
,
Lidia Tendera
SIAM Journal on Computing
29
(4), 2000, pp. 1083-1117
Is your model checker on time? On the complexity of model checking for timed modal logics
Luca Aceto
,
François Laroussinie
Lecture Notes in Computer Science
1672
, 1999, pp. 125-136
Football elimination is hard to decide under the 3-point-rule
Thorsten Bernholt
,
Alexander Gülich
,
Thomas Hofmeister
,
Niels Schmitt
Lecture Notes in Computer Science
1672
, 1999, pp. 410-418
Clausal resolution for CTL
\star
Alexander Bolotov
,
Clare Dixon
,
Michael Fisher
Lecture Notes in Computer Science
1672
, 1999, pp. 137-148
Edge coloring of bipartite graphs
Ioannis Caragiannis
,
Christos Kaklamanis
,
Pino Persiano
Lecture Notes in Computer Science
1672
, 1999, pp. 376-386
An improved disjunctive strictness analysis
Grzegorz Crudziński
Lecture Notes in Computer Science
1672
, 1999, pp. 187-197
An algebraic approach to knowledge representation
Jānis Cīrulis
Lecture Notes in Computer Science
1672
, 1999, pp. 299-309
On the complexity of recognizing the Hilbert basis of a linear diophantine system
Arnaud Durand
,
Miki Hermann
,
Laurent Juban
Lecture Notes in Computer Science
1672
, 1999, pp. 92-102
An efficient exact algorithm for constraint bipartite vertex cover
Henning Fernau
,
Rolf Niedermeier
Lecture Notes in Computer Science
1672
, 1999, pp. 387-397
On plain and hereditary history-preserving bisimulation
Sibylle B. Fröschle
,
Thomas T. Hildebrandt
Lecture Notes in Computer Science
1672
, 1999, pp. 354-365
On-line addition in real base
Christiane Frougny
Lecture Notes in Computer Science
1672
, 1999, pp. 1-11
On approximating the number of bases of exchange preserving matroids
Anna Gambin
Lecture Notes in Computer Science
1672
, 1999, pp. 332-342
Efficiency of fast parallel pattern searching in highly compressed texts
Leszek Gaşieniec
,
Alan Gibbons
,
Wojciech Rytter
Lecture Notes in Computer Science
1672
, 1999, pp. 48-58
Lower and upper bounds for the problem of page replication in ring networks
Wƚodzimierz Gƚazek
Lecture Notes in Computer Science
1672
, 1999, pp. 273-283
The complexity of the extended GCD problem
George Havas
,
Jean-Pierre Seifert
Lecture Notes in Computer Science
1672
, 1999, pp. 103-113
New perspectives in distributed computing
Maurice Herlihy
,
Sergio Rajsbaum
Lecture Notes in Computer Science
1672
, 1999, pp. 170-186
Generalized regular counting classes
Ulrich Hertrampf
Lecture Notes in Computer Science
1672
, 1999, pp. 419-429
Model checking and higher-order recursion
Hardi Hungar
Lecture Notes in Computer Science
1672
, 1999, pp. 149-159
On the structure of the monadic logic of the binary tree
D. Janin
,
G. Lenzi
Lecture Notes in Computer Science
1672
, 1999, pp. 310-320
Language-based security
Dexter Kozen
Lecture Notes in Computer Science
1672
, 1999, pp. 284-298
The STO problem is
NP
-complete
Piotr Krysta
,
Leszek Pacholski
Journal Symbolic Computation
27
(2), 1999, pp. 207-219
Unique fixed point induction for McCarthys Amb
Sren B. Lassen
,
Andrew Moran
Lecture Notes in Computer Science
1672
, 1999, pp. 198-208
Complexity results for confluence problems
Markus Lohrey
Lecture Notes in Computer Science
1672
, 1999, pp. 114-124
Computing and comparing semantics of programs in four-valued logics
Yann Loyer
,
Nicolas Spyratos
,
Daniel Stamate
Lecture Notes in Computer Science
1672
, 1999, pp. 59-69
Seiten 1
2
>