Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Amir M. Ben-Amram" ( http://dblp.L3S.de/Authors/Amir_M._Ben-Amram )

URL (Homepage):  http://www2.mta.ac.il/~amirben/  Author page on DBLP  Author page in RDF  Community of Amir M. Ben-Amram in ASPL-2

Publication years (Num. hits)
1988-1999 (17) 2000-2008 (16) 2009-2012 (14)
Publication types (Num. hits)
article(32) inproceedings(15)
Venues (Conferences, Journals, ...)
Acta Inf.(3) CoRR(3) FOCS(3) Logical Methods in Computer Sc...(3) SIGACT News(3) Theor. Comput. Sci.(3) ACM Trans. Program. Lang. Syst...(2) Algorithmica(2) ICALP(2) J. ACM(2) STOC(2) Bulletin of the EATCS(1) CAV(1) CiE(1) DICE(1) Electronic Colloquium on Compu...(1) More (+10 of total 30)
Authors
Amir M. Ben-Amram(47) Zvi Galil(10) Holger Petersen(5) Neil D. Jones(4) Chin Soon Lee(3) Michael Codish(3) Carsten Fuhs(2) Igor Gonopolskiy(2) Jürgen Giesl(2) Omer Berkman(2) Simon Yoffe(2) Abu Naser Masud(1) Bruno Loff(1) Bryant A. Julstrom(1) Costas S. Iliopoulos(1) Isabel Oitavem(1) More (+10 of total 23)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 43 occurrences of 32 keywords
Results
Found 47 publication records. Showing 47 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Amir M. Ben-Amram, Simon Yoffe Corrigendum to "A simple and efficient Union-Find-Delete algorithm" [Theoret. Comput. Sci. 412(4-5) 487-492]. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram, Bruno Loff, Isabel Oitavem Monotonicity Constraints in Characterizations of PSPACE. Search on Bibsonomy J. Log. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram, Michael Vainer Bounded Termination of Monotonicity-Constraint Transition Systems Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Amir M. Ben-Amram, Samir Genaim, Abu Naser Masud On the Termination of Integer Loops. Search on Bibsonomy VMCAI The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram, Simon Yoffe A simple and efficient Union-Find-Delete algorithm. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Amir M. Ben-Amram Monotonicity Constraints for Termination in the Integer Domain Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl SAT-based termination analysis using monotonicity constraints over the integers. Search on Bibsonomy TPLP The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram Size-Change Termination, Monotonicity Constraints and Ranking Functions Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2010 DBLP  BibTeX  RDF
1Amir M. Ben-Amram On Decidable Growth-Rate Properties of Imperative Programs Search on Bibsonomy DICE The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram A complexity tradeoff in ranking-function termination proofs. Search on Bibsonomy Acta Inf. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram, Chin Soon Lee Ranking Functions for Size-Change Termination II Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2009 DBLP  BibTeX  RDF
1Amir M. Ben-Amram The Euler Path to Static Level-Ancestors Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Amir M. Ben-Amram Size-Change Termination, Monotonicity Constraints and Ranking Functions. Search on Bibsonomy CAV The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram Size-change termination with difference constraints. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF size-change graph, size-change termination, Abstraction, program analysis, termination analysis
1Amir M. Ben-Amram, Michael Codish A SAT-Based Approach to Size Change Termination with Global Ranking Functions. Search on Bibsonomy TACAS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. Search on Bibsonomy CiE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF linear time complexity, static program analysis, polynomial time complexity, implicit computational complexity
1Amir M. Ben-Amram, Chin Soon Lee Program termination analysis in polynomial time. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF size-change graph, size-change termination, Abstraction, program analysis, termination analysis
1Amir M. Ben-Amram, Holger Petersen Backing up in singly linked lists. Search on Bibsonomy J. ACM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF two way automata, string matching, Incompressibility
1Amir M. Ben-Amram The Church-Turing thesis and its look-alikes. Search on Bibsonomy SIGACT News The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram A complexity-theoretic proof of a Recursion-Theoretic Theorem. Search on Bibsonomy SIGACT News The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram Tighter constant-factor time hierarchies. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram, Omer Berkman, Holger Petersen Element distinctness on one-tape Turing machines: a complete solution. Search on Bibsonomy Acta Inf. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram, Zvi Galil Lower Bounds for Dynamic Data Structures on Algebraic RAMs. Search on Bibsonomy Algorithmica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Cell-probe lower bounds, Dynamic prefix sum, Union-find, Random access machine
1Amir M. Ben-Amram, Holger Petersen Improved Bounds for Functions Related to Busy Beavers. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram General Size-Change Termination and Lexicographic Descent. Search on Bibsonomy The Essence of Computation The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram, Zvi Galil A Generalization of a Lower Bound Technique due to Fredman and Saks. Search on Bibsonomy Algorithmica The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Algorithms, Parallel computing, Implementation, List ranking
1Amir M. Ben-Amram, Zvi Galil Topological Lower Bounds on Algebraic Random Access Machines. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram The size-change principle for program termination. Search on Bibsonomy POPL The full citation details ... 2001 DBLP  DOI  BibTeX  RDF omega automaton, program analysis, termination, partial evaluation, PSPACE-completeness
1Amir M. Ben-Amram, Neil D. Jones Computational complexity via programming languages: constant factors do matter. Search on Bibsonomy Acta Inf. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram, Neil D. Jones A Precise Version of a Time Hierarchy Theorem. Search on Bibsonomy Fundam. Inform. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Stephen Alstrup, Amir M. Ben-Amram, Theis Rauhe Worst-Case and Amortised Optimality in Union-Find (Extended Abstract). Search on Bibsonomy STOC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram, Holger Petersen Backing Up in Singly Linked Lists. Search on Bibsonomy STOC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram Introducing: Reasonable Complete Programming Languages. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 1998 DBLP  BibTeX  RDF
1Amir M. Ben-Amram, Holger Petersen CONS-Free Programs with Tree Input (Extended Abstract). Search on Bibsonomy ICALP The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram When Can We Sort in o(n log n) Time? Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram, Bryant A. Julstrom, Uri Zwick A Note on Busy Beavers and Other Creatures. Search on Bibsonomy Mathematical Systems Theory The full citation details ... 1996 DBLP  BibTeX  RDF
1Amir M. Ben-Amram, Zvi Galil On Data Structure Tradeoffs and an Application to Union-Find Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1995 DBLP  BibTeX  RDF
1Amir M. Ben-Amram, Zvi Galil On the Power of the Shift Instruction Search on Bibsonomy Inf. Comput. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram What is a "pointer machine"? Search on Bibsonomy SIGACT News The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram, Zvi Galil Lower Bounds on Algebraic Random Access Machines (Extended Abstract). Search on Bibsonomy ICALP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram Unit-Cost Pointers versus Logarithmic-Cost Addresses. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park The Subtree Max Gap Problem with Application to Parallel String Covering. Search on Bibsonomy SODA The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Amir M. Ben-Amram, Zvi Galil When can we sort in o(n log n) time? Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF Boolean instructions, arithmetic instructions, nonuniform programs, double-precision multiplication, lower bounds, upper bounds, random access machine
1Amir M. Ben-Amram, Zvi Galil On Pointers versus Addresses. Search on Bibsonomy J. ACM The full citation details ... 1992 DBLP  DOI  BibTeX  RDF pointer structures, random access memory, incompressibility
1Amir M. Ben-Amram, Zvi Galil Lower Bounds for Data Structure Problems on RAMs (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF union-find problem, average case time, data structure problems, output variability, problem variability, unbounded integers, lower bounds, upper bound, RAMs, worst case time
1Amir M. Ben-Amram, Zvi Galil On Pointers versus Addresses (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1988 DBLP  DOI  BibTeX  RDF countable closed set, random addressing, pointer machine, RAM program, set of primitives, continuously differentiable, lower bound, time, tree, functions, space, Kolmogorov complexity, strings, data type, pointers, addresses, random-access memory, real numbers, incompressibility
Displaying result #1 - #47 of 47 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.