Author:  
All :: A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z 
References
25.
S. Albeverio, Z. Brzeźniak and L. D\polhk abrowski
Time-dependent propagator with point interaction
J. Phys. A, 27(14):4933--4943
1994
24.
Elias Dahlhaus, Péter Hajnal and Marek Karpinski
On the parallel complexity of Hamiltonian cycle and matching problem on dense graphs
J. Algorithms, 15(3):367--384
1993
23.
Elias Dahlhaus, Marek Karpinski and Pierre Kelsen
An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3
Inform. Process. Lett., 42(6):309--313
1992
22.
Elias Dahlhaus and Marek Karpinski
Perfect matching for regular graphs is {AC^0}-hard for the general matching problem
J. Comput. System Sci., 44(1):94--102
1992
21.
Michael Clausen, Andreas Dress, Johannes Grabmeier and Marek Karpinski
On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields
Theoret. Comput. Sci., 84(2, Algorithms Automat. Complexity Games):151--164
1991
20.
G. Dolzmann and J. Frehse
Optimale asymptotische Konvergenz linearer finiter Elemente bei elliptischen Problemen mit Hilfe von Campanato-Abschätzungen
Extrapolation and defect correction (1990) Volume 228 of Bonner Math. Schriften
page 95--120.
Publisher: Univ. Bonn, Bonn,
1991
19.
E. E. Demidov, Yu. I. Manin, E. E. Mukhin and D. V. Zhdanovich
Nonstandard quantum deformations of {GL(n)} and constant solutions of the Yang-Baxter equation
page 203--218 (1991).
1990
18.
Sergio Albeverio, Teresa Arede and Margarida de Faria
Remarks on nonlinear filtering problems: white noise representation and asymptotic expansions
Stochastic processes, physics and geometry (Ascona and Locarno, 1988)
page 77--86.
Publisher: World Sci. Publ., Teaneck, NJ,
1990
17.
Elias Dahlhaus and Marek Karpinski
Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs
Theoret. Comput. Sci., 61(2-3):121--136
1988
16.
Hans-Dieter Donder, Peter Koepke and Jean-Pierre Levinski
Some stationary subsets of {<scr>P</scr>(λ)}
Proc. Amer. Math. Soc., 102(4):1000--1004
1988
15.
Elias Dahlhaus and Marek Karpinski
A fast parallel algorithm for computing all maximal cliques in a graph and the related problems (extended abstract)
SWAT 88 (Halmstad, 1988) Volume 318 of Lecture Notes in Comput. Sci.
page 139--144.
Publisher: Springer, Berlin,
1988
14.
Hans-Dieter Donder and Peter Koepke
On the consistency strength of â??accessibleâ?? Jónsson cardinals and of the weak Chang conjecture
Ann. Pure Appl. Logic, 25(3):233--261
1983
Page:  
Previous | 1, ... , 30, 31, 32, 33, 34, 35 | Next
Export as:
BibTeX, XML