Prunescu, Mihai
39  Ergebnisse:
Personensuche X
?
 
?
2

Smooth approximations by continuous choice-functions:

Prunescu, Mihai
Soft Computing.  25 (2021)  21 - p. 13277-13286 , 2021
 
?
 
?
4

Secure Multiparty Computation in arbitrary rings:

, In: 2021 23rd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC),
Prunescu, Mihai - p. 283-290 , 2021
 
?
5

THE EXPONENTIAL DIOPHANTINE PROBLEM FOR:

PRUNESCU, MIHAI
The Journal of Symbolic Logic.  85 (2020)  2 - p. 671-672 , 2020
 
?
 
?
7

A two-valued recurrent double sequence that is not automati:

Prunescu, Mihai
Theoretical Computer Science.  528 (2014)  - p. 32-39 , 2014
 
?
8

Fp-affine recurrent n-dimensional sequences over Fq are p-a..:

Prunescu, Mihai
European Journal of Combinatorics.  34 (2013)  2 - p. 260-284 , 2013
 
?
10

The Thue–Morse–Pascal double sequence and similar structure:

Prunescu, Mihai
Comptes Rendus Mathematique.  349 (2011)  17-18 - p. 939-942 , 2011
 
?
11

Self-similar carpets over finite fields:

Prunescu, Mihai
European Journal of Combinatorics.  30 (2009)  4 - p. 866-878 , 2009
 
?
13

Structure with Fast Elimination of Quantifiers:

Prunescu, Mihai
The Journal of Symbolic Logic.  71 (2006)  1 - p. 321-328 , 2006
 
?
14

Two situations with unit-cost: ordered abelian semi-groups ..:

Prunescu, Mihai
Journal of Complexity.  21 (2005)  4 - p. 579-592 , 2005
 
?
15

Structures that eliminate quantifier blocks in polynomial t.. 

[Preprint-Reihe Mathematik / Institut für Mathematik und Informatik, Ernst-Moritz-Arndt-Universität Greifswald] ; [2003,18]
 
1-15