The following pages link to András A. Benczúr (Q1300053):
Displaying 19 items.
- On the number of occurrences of sequence patterns (Q579945) (← links)
- The evolution of human communication and the information revolution --- A mathematical perspective (Q596949) (← links)
- On the expected time of the first occurrence of every k bit long patterns in the symmetric Bernoulli process (Q1086903) (← links)
- Some constraints assuring serializability in multidatabases (Q1130390) (← links)
- Dynamic placement of records and the classical occupancy problem (Q1145997) (← links)
- Covering symmetric supermodular functions by graphs (Q1300054) (← links)
- Parallel and fast sequential algorithms for undirected edge connectivity augmentation (Q1300063) (← links)
- Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems (Q1406022) (← links)
- (Q1816651) (redirect page) (← links)
- (Q579944) (redirect page) (← links)
- (Q1130387) (redirect page) (← links)
- (Q579944) (redirect page) (← links)
- Classical and weighted knowledgebase transformations (Q1816654) (← links)
- Functional dependencies on extended relations defined by regular languages (Q2254640) (← links)
- On a general class of data dependencies in the relational model and its implication problems (Q2639634) (← links)
- (Q2753925) (← links)
- (Q2770735) (← links)
- (Q2770736) (← links)
- Augmenting undirected connectivity in RNC and in randomized Õ(<i>n</i><sup>3</sup>) time (Q2817659) (← links)
- (Q2921669) (← links)
- (Q2937612) (← links)
- (Q3396881) (← links)
